/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:55:07,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:55:07,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:55:07,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:55:07,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:55:07,692 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:55:07,695 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:55:07,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:55:07,701 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:55:07,705 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:55:07,706 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:55:07,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:55:07,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:55:07,711 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:55:07,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:55:07,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:55:07,718 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:55:07,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:55:07,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:55:07,729 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:55:07,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:55:07,732 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:55:07,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:55:07,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:55:07,736 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:55:07,736 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:55:07,736 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:55:07,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:55:07,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:55:07,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:55:07,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:55:07,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:55:07,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:55:07,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:55:07,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:55:07,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:55:07,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:55:07,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:55:07,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:55:07,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:55:07,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:55:07,752 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-11 14:55:07,792 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:55:07,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:55:07,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:55:07,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:55:07,794 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:55:07,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:55:07,795 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:55:07,795 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:55:07,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:55:07,796 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:55:07,797 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:55:07,797 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:55:07,797 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:55:07,798 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:55:07,798 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:55:07,798 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:55:07,798 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:55:07,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:55:07,799 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:55:07,799 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:55:07,799 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:55:07,799 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:55:07,800 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:55:07,800 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:55:07,800 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:55:07,800 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:55:07,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:55:07,801 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:55:07,801 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:55:07,801 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:55:08,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:55:08,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:55:08,131 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:55:08,132 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:55:08,133 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:55:08,133 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i [2020-10-11 14:55:08,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a4be3b7/37a64810392d4d27a79725ee861045d0/FLAG820a3cd9b [2020-10-11 14:55:08,773 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:55:08,774 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix053_rmo.opt.i [2020-10-11 14:55:08,790 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a4be3b7/37a64810392d4d27a79725ee861045d0/FLAG820a3cd9b [2020-10-11 14:55:09,072 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32a4be3b7/37a64810392d4d27a79725ee861045d0 [2020-10-11 14:55:09,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:55:09,085 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:55:09,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:55:09,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:55:09,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:55:09,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73ff41f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09, skipping insertion in model container [2020-10-11 14:55:09,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:55:09,155 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:55:09,608 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:55:09,622 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:55:09,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:55:09,798 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:55:09,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09 WrapperNode [2020-10-11 14:55:09,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:55:09,802 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:55:09,802 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:55:09,802 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:55:09,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,838 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,868 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:55:09,868 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:55:09,869 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:55:09,869 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:55:09,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,900 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (1/1) ... [2020-10-11 14:55:09,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:55:09,915 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:55:09,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:55:09,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:55:09,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (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-11 14:55:09,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:55:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:55:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:55:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:55:09,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:55:09,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:55:09,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:55:09,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:55:09,997 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 14:55:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 14:55:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 14:55:09,998 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 14:55:09,998 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:55:09,999 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:55:09,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:55:10,001 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-11 14:55:11,791 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:55:11,791 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 14:55:11,794 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:11 BoogieIcfgContainer [2020-10-11 14:55:11,794 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:55:11,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:55:11,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:55:11,799 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:55:11,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:55:09" (1/3) ... [2020-10-11 14:55:11,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd491d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:11, skipping insertion in model container [2020-10-11 14:55:11,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:55:09" (2/3) ... [2020-10-11 14:55:11,801 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@dd491d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:55:11, skipping insertion in model container [2020-10-11 14:55:11,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:55:11" (3/3) ... [2020-10-11 14:55:11,803 INFO L111 eAbstractionObserver]: Analyzing ICFG mix053_rmo.opt.i [2020-10-11 14:55:11,815 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:55:11,815 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:55:11,823 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 14:55:11,824 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:55:11,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,856 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,856 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,857 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,857 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,858 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,858 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,858 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,859 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,859 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,860 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,860 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,861 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,862 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,863 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,864 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,865 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,866 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,867 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,869 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,870 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,870 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,870 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,870 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,871 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,871 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,872 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,873 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,877 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,878 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,879 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,879 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,880 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,880 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,881 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,882 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,885 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,885 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,886 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,887 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,887 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,887 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,889 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,890 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,890 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,894 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,894 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:55:11,911 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 14:55:11,932 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:55:11,932 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:55:11,932 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:55:11,932 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:55:11,933 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:55:11,933 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:55:11,933 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:55:11,933 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:55:11,947 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:55:11,950 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-11 14:55:11,953 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 107 transitions, 234 flow [2020-10-11 14:55:11,955 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 118 places, 107 transitions, 234 flow [2020-10-11 14:55:12,006 INFO L129 PetriNetUnfolder]: 2/103 cut-off events. [2020-10-11 14:55:12,006 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:55:12,011 INFO L80 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 2/103 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2020-10-11 14:55:12,015 INFO L117 LiptonReduction]: Number of co-enabled transitions 2248 [2020-10-11 14:55:12,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:55:12,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-11 14:55:12,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-11 14:55:12,221 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,322 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:55:12,323 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:55:12,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:55:12,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:12,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:12,432 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:55:12,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:12,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:55:12,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:12,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:55:12,438 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:12,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:55:12,441 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,444 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-11 14:55:12,444 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,446 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-11 14:55:12,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,534 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:55:12,535 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,536 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:55:12,537 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:55:12,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:12,743 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-11 14:55:13,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:55:13,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:13,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:55:13,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:13,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:55:13,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:13,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:55:13,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:13,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:55:13,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,048 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-11 14:55:13,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,050 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-11 14:55:13,051 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:55:13,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:55:13,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:55:13,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,159 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:55:13,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:55:13,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:55:13,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,497 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-11 14:55:13,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:55:13,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,834 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-11 14:55:13,835 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:13,836 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-11 14:55:13,836 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:14,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:55:14,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-11 14:55:14,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:55:14,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:14,247 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:55:14,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:55:14,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:55:14,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:14,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:55:14,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:14,254 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:55:14,255 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:55:14,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:55:14,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:14,258 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-11 14:55:14,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:14,260 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-11 14:55:14,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:55:14,503 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-11 14:55:14,656 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-11 14:55:15,706 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2020-10-11 14:55:15,821 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2020-10-11 14:55:15,924 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-10-11 14:55:15,976 INFO L132 LiptonReduction]: Checked pairs total: 4878 [2020-10-11 14:55:15,977 INFO L134 LiptonReduction]: Total number of compositions: 85 [2020-10-11 14:55:15,984 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 30 transitions, 80 flow [2020-10-11 14:55:16,102 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 2090 states. [2020-10-11 14:55:16,104 INFO L276 IsEmpty]: Start isEmpty. Operand 2090 states. [2020-10-11 14:55:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-11 14:55:16,113 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:16,114 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:16,115 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:16,121 INFO L82 PathProgramCache]: Analyzing trace with hash -543229691, now seen corresponding path program 1 times [2020-10-11 14:55:16,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:16,133 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509904625] [2020-10-11 14:55:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:16,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:16,423 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-11 14:55:16,423 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509904625] [2020-10-11 14:55:16,424 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:16,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:55:16,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572370153] [2020-10-11 14:55:16,430 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:55:16,431 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:16,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:55:16,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:16,450 INFO L87 Difference]: Start difference. First operand 2090 states. Second operand 3 states. [2020-10-11 14:55:16,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:16,536 INFO L93 Difference]: Finished difference Result 1770 states and 6672 transitions. [2020-10-11 14:55:16,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:55:16,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-11 14:55:16,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:16,571 INFO L225 Difference]: With dead ends: 1770 [2020-10-11 14:55:16,572 INFO L226 Difference]: Without dead ends: 1450 [2020-10-11 14:55:16,573 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-10-11 14:55:16,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1450. [2020-10-11 14:55:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1450 states. [2020-10-11 14:55:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1450 states to 1450 states and 5376 transitions. [2020-10-11 14:55:16,719 INFO L78 Accepts]: Start accepts. Automaton has 1450 states and 5376 transitions. Word has length 9 [2020-10-11 14:55:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:16,721 INFO L481 AbstractCegarLoop]: Abstraction has 1450 states and 5376 transitions. [2020-10-11 14:55:16,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:55:16,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1450 states and 5376 transitions. [2020-10-11 14:55:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-11 14:55:16,726 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:16,726 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:16,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:55:16,726 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:16,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:16,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1942314390, now seen corresponding path program 1 times [2020-10-11 14:55:16,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:16,728 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28630612] [2020-10-11 14:55:16,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:16,841 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-11 14:55:16,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28630612] [2020-10-11 14:55:16,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:16,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:55:16,843 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998327177] [2020-10-11 14:55:16,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:55:16,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:16,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:55:16,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:16,845 INFO L87 Difference]: Start difference. First operand 1450 states and 5376 transitions. Second operand 3 states. [2020-10-11 14:55:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:16,866 INFO L93 Difference]: Finished difference Result 1410 states and 5194 transitions. [2020-10-11 14:55:16,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:55:16,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-11 14:55:16,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:16,877 INFO L225 Difference]: With dead ends: 1410 [2020-10-11 14:55:16,878 INFO L226 Difference]: Without dead ends: 1410 [2020-10-11 14:55:16,879 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-10-11 14:55:16,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2020-10-11 14:55:16,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2020-10-11 14:55:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 5194 transitions. [2020-10-11 14:55:16,979 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 5194 transitions. Word has length 11 [2020-10-11 14:55:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:16,980 INFO L481 AbstractCegarLoop]: Abstraction has 1410 states and 5194 transitions. [2020-10-11 14:55:16,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:55:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 5194 transitions. [2020-10-11 14:55:16,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 14:55:16,982 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:16,983 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:16,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:55:16,983 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:16,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:16,984 INFO L82 PathProgramCache]: Analyzing trace with hash -710105351, now seen corresponding path program 1 times [2020-10-11 14:55:16,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:16,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897424853] [2020-10-11 14:55:16,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:17,032 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-11 14:55:17,033 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897424853] [2020-10-11 14:55:17,033 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:17,033 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:55:17,033 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077808187] [2020-10-11 14:55:17,034 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:55:17,034 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:55:17,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:17,035 INFO L87 Difference]: Start difference. First operand 1410 states and 5194 transitions. Second operand 3 states. [2020-10-11 14:55:17,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:17,053 INFO L93 Difference]: Finished difference Result 1380 states and 5060 transitions. [2020-10-11 14:55:17,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:55:17,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-10-11 14:55:17,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:17,065 INFO L225 Difference]: With dead ends: 1380 [2020-10-11 14:55:17,065 INFO L226 Difference]: Without dead ends: 1380 [2020-10-11 14:55:17,065 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-10-11 14:55:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1380. [2020-10-11 14:55:17,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1380 states. [2020-10-11 14:55:17,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 5060 transitions. [2020-10-11 14:55:17,114 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 5060 transitions. Word has length 12 [2020-10-11 14:55:17,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:17,114 INFO L481 AbstractCegarLoop]: Abstraction has 1380 states and 5060 transitions. [2020-10-11 14:55:17,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:55:17,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 5060 transitions. [2020-10-11 14:55:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:55:17,117 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:17,117 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:17,117 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:55:17,117 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:17,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:17,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1886679985, now seen corresponding path program 1 times [2020-10-11 14:55:17,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:17,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992232687] [2020-10-11 14:55:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:17,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:17,153 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-11 14:55:17,154 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992232687] [2020-10-11 14:55:17,154 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:17,154 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:55:17,155 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207200729] [2020-10-11 14:55:17,155 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:55:17,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:17,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:55:17,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:17,156 INFO L87 Difference]: Start difference. First operand 1380 states and 5060 transitions. Second operand 3 states. [2020-10-11 14:55:17,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:17,180 INFO L93 Difference]: Finished difference Result 1868 states and 6582 transitions. [2020-10-11 14:55:17,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:55:17,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-10-11 14:55:17,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:17,192 INFO L225 Difference]: With dead ends: 1868 [2020-10-11 14:55:17,193 INFO L226 Difference]: Without dead ends: 1460 [2020-10-11 14:55:17,193 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:17,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-10-11 14:55:17,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1340. [2020-10-11 14:55:17,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2020-10-11 14:55:17,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 4694 transitions. [2020-10-11 14:55:17,242 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 4694 transitions. Word has length 13 [2020-10-11 14:55:17,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:17,242 INFO L481 AbstractCegarLoop]: Abstraction has 1340 states and 4694 transitions. [2020-10-11 14:55:17,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:55:17,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 4694 transitions. [2020-10-11 14:55:17,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-11 14:55:17,244 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:17,244 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:17,245 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:55:17,245 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:17,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:17,245 INFO L82 PathProgramCache]: Analyzing trace with hash -538429830, now seen corresponding path program 1 times [2020-10-11 14:55:17,246 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:17,246 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861372690] [2020-10-11 14:55:17,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:17,307 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-11 14:55:17,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861372690] [2020-10-11 14:55:17,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:17,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:55:17,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289055415] [2020-10-11 14:55:17,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:55:17,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:17,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:55:17,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:55:17,310 INFO L87 Difference]: Start difference. First operand 1340 states and 4694 transitions. Second operand 4 states. [2020-10-11 14:55:17,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:17,361 INFO L93 Difference]: Finished difference Result 1388 states and 4406 transitions. [2020-10-11 14:55:17,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 14:55:17,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-11 14:55:17,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:17,370 INFO L225 Difference]: With dead ends: 1388 [2020-10-11 14:55:17,371 INFO L226 Difference]: Without dead ends: 1068 [2020-10-11 14:55:17,371 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:17,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2020-10-11 14:55:17,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1068. [2020-10-11 14:55:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1068 states. [2020-10-11 14:55:17,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1068 states to 1068 states and 3382 transitions. [2020-10-11 14:55:17,405 INFO L78 Accepts]: Start accepts. Automaton has 1068 states and 3382 transitions. Word has length 13 [2020-10-11 14:55:17,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:17,405 INFO L481 AbstractCegarLoop]: Abstraction has 1068 states and 3382 transitions. [2020-10-11 14:55:17,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:55:17,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1068 states and 3382 transitions. [2020-10-11 14:55:17,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:55:17,407 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:17,408 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:17,408 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:55:17,408 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:17,408 INFO L82 PathProgramCache]: Analyzing trace with hash -177822953, now seen corresponding path program 1 times [2020-10-11 14:55:17,409 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:17,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445646396] [2020-10-11 14:55:17,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:17,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:17,474 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-11 14:55:17,475 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445646396] [2020-10-11 14:55:17,475 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:17,475 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:55:17,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713447384] [2020-10-11 14:55:17,476 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:55:17,476 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:17,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:55:17,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:17,480 INFO L87 Difference]: Start difference. First operand 1068 states and 3382 transitions. Second operand 3 states. [2020-10-11 14:55:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:17,501 INFO L93 Difference]: Finished difference Result 1476 states and 4486 transitions. [2020-10-11 14:55:17,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:55:17,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-10-11 14:55:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:17,509 INFO L225 Difference]: With dead ends: 1476 [2020-10-11 14:55:17,509 INFO L226 Difference]: Without dead ends: 1104 [2020-10-11 14:55:17,510 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:55:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2020-10-11 14:55:17,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 1046. [2020-10-11 14:55:17,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2020-10-11 14:55:17,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 3141 transitions. [2020-10-11 14:55:17,545 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 3141 transitions. Word has length 15 [2020-10-11 14:55:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:17,546 INFO L481 AbstractCegarLoop]: Abstraction has 1046 states and 3141 transitions. [2020-10-11 14:55:17,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:55:17,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 3141 transitions. [2020-10-11 14:55:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-11 14:55:17,549 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:17,549 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:17,549 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:55:17,549 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:17,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1050389761, now seen corresponding path program 1 times [2020-10-11 14:55:17,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:17,550 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867108047] [2020-10-11 14:55:17,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:17,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:17,646 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-11 14:55:17,646 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867108047] [2020-10-11 14:55:17,647 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:17,647 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:55:17,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614181003] [2020-10-11 14:55:17,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:55:17,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:17,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:55:17,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:17,648 INFO L87 Difference]: Start difference. First operand 1046 states and 3141 transitions. Second operand 5 states. [2020-10-11 14:55:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:17,698 INFO L93 Difference]: Finished difference Result 912 states and 2468 transitions. [2020-10-11 14:55:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:55:17,699 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-11 14:55:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:17,704 INFO L225 Difference]: With dead ends: 912 [2020-10-11 14:55:17,704 INFO L226 Difference]: Without dead ends: 700 [2020-10-11 14:55:17,704 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:55:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2020-10-11 14:55:17,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2020-10-11 14:55:17,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2020-10-11 14:55:17,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1861 transitions. [2020-10-11 14:55:17,722 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1861 transitions. Word has length 15 [2020-10-11 14:55:17,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:17,723 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 1861 transitions. [2020-10-11 14:55:17,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:55:17,723 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1861 transitions. [2020-10-11 14:55:17,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-11 14:55:17,725 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:17,725 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:17,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:55:17,725 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:17,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:17,726 INFO L82 PathProgramCache]: Analyzing trace with hash 370067579, now seen corresponding path program 1 times [2020-10-11 14:55:17,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:17,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629038219] [2020-10-11 14:55:17,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:17,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:17,810 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-11 14:55:17,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629038219] [2020-10-11 14:55:17,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:17,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:55:17,811 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333658575] [2020-10-11 14:55:17,811 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:55:17,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:17,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:55:17,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:55:17,812 INFO L87 Difference]: Start difference. First operand 700 states and 1861 transitions. Second operand 6 states. [2020-10-11 14:55:17,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:17,881 INFO L93 Difference]: Finished difference Result 607 states and 1569 transitions. [2020-10-11 14:55:17,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:55:17,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-11 14:55:17,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:17,885 INFO L225 Difference]: With dead ends: 607 [2020-10-11 14:55:17,885 INFO L226 Difference]: Without dead ends: 488 [2020-10-11 14:55:17,886 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:55:17,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2020-10-11 14:55:17,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2020-10-11 14:55:17,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2020-10-11 14:55:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1246 transitions. [2020-10-11 14:55:17,897 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1246 transitions. Word has length 17 [2020-10-11 14:55:17,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:17,897 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 1246 transitions. [2020-10-11 14:55:17,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:55:17,897 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1246 transitions. [2020-10-11 14:55:17,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-11 14:55:17,898 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:17,899 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:17,899 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 14:55:17,899 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:17,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:17,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1261578529, now seen corresponding path program 1 times [2020-10-11 14:55:17,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:17,900 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374056949] [2020-10-11 14:55:17,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:17,984 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-11 14:55:17,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374056949] [2020-10-11 14:55:17,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:17,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:55:17,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692216570] [2020-10-11 14:55:17,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:55:17,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:17,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:55:17,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:55:17,986 INFO L87 Difference]: Start difference. First operand 488 states and 1246 transitions. Second operand 7 states. [2020-10-11 14:55:18,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:18,070 INFO L93 Difference]: Finished difference Result 465 states and 1200 transitions. [2020-10-11 14:55:18,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:55:18,071 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-10-11 14:55:18,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:18,072 INFO L225 Difference]: With dead ends: 465 [2020-10-11 14:55:18,072 INFO L226 Difference]: Without dead ends: 187 [2020-10-11 14:55:18,073 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-11 14:55:18,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-10-11 14:55:18,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2020-10-11 14:55:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2020-10-11 14:55:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 447 transitions. [2020-10-11 14:55:18,078 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 447 transitions. Word has length 20 [2020-10-11 14:55:18,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:18,078 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 447 transitions. [2020-10-11 14:55:18,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:55:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 447 transitions. [2020-10-11 14:55:18,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 14:55:18,079 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:18,079 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:18,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 14:55:18,079 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:18,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1242244738, now seen corresponding path program 1 times [2020-10-11 14:55:18,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:18,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633922259] [2020-10-11 14:55:18,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:18,130 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-11 14:55:18,131 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633922259] [2020-10-11 14:55:18,131 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:18,131 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:55:18,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115008150] [2020-10-11 14:55:18,132 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:55:18,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:18,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:55:18,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:55:18,132 INFO L87 Difference]: Start difference. First operand 187 states and 447 transitions. Second operand 4 states. [2020-10-11 14:55:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:18,146 INFO L93 Difference]: Finished difference Result 252 states and 596 transitions. [2020-10-11 14:55:18,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 14:55:18,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-11 14:55:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:18,148 INFO L225 Difference]: With dead ends: 252 [2020-10-11 14:55:18,148 INFO L226 Difference]: Without dead ends: 79 [2020-10-11 14:55:18,148 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:18,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-10-11 14:55:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-10-11 14:55:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-10-11 14:55:18,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 165 transitions. [2020-10-11 14:55:18,151 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 165 transitions. Word has length 24 [2020-10-11 14:55:18,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:18,151 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 165 transitions. [2020-10-11 14:55:18,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:55:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 165 transitions. [2020-10-11 14:55:18,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 14:55:18,152 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:18,152 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:18,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 14:55:18,152 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:18,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:18,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1788376548, now seen corresponding path program 2 times [2020-10-11 14:55:18,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:18,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133076710] [2020-10-11 14:55:18,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:55:18,270 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-11 14:55:18,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133076710] [2020-10-11 14:55:18,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:55:18,271 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:55:18,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427543219] [2020-10-11 14:55:18,272 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:55:18,272 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:55:18,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:55:18,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:55:18,273 INFO L87 Difference]: Start difference. First operand 79 states and 165 transitions. Second operand 5 states. [2020-10-11 14:55:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:55:18,319 INFO L93 Difference]: Finished difference Result 97 states and 199 transitions. [2020-10-11 14:55:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:55:18,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2020-10-11 14:55:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:55:18,321 INFO L225 Difference]: With dead ends: 97 [2020-10-11 14:55:18,321 INFO L226 Difference]: Without dead ends: 51 [2020-10-11 14:55:18,321 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:55:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-11 14:55:18,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2020-10-11 14:55:18,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-11 14:55:18,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 89 transitions. [2020-10-11 14:55:18,323 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 89 transitions. Word has length 24 [2020-10-11 14:55:18,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:55:18,323 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 89 transitions. [2020-10-11 14:55:18,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:55:18,324 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 89 transitions. [2020-10-11 14:55:18,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-11 14:55:18,324 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:55:18,324 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:55:18,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 14:55:18,325 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:55:18,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:55:18,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1046254044, now seen corresponding path program 3 times [2020-10-11 14:55:18,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:55:18,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911814677] [2020-10-11 14:55:18,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:55:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:55:18,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:55:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:55:18,444 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:55:18,500 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 14:55:18,501 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 14:55:18,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 14:55:18,502 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-11 14:55:18,524 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] L3-->L851: Formula: (let ((.cse9 (= (mod ~z$r_buff1_thd0~0_In-680645634 256) 0)) (.cse8 (= (mod ~z$w_buff1_used~0_In-680645634 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In-680645634 256) 0)) (.cse6 (= (mod ~z$r_buff0_thd0~0_In-680645634 256) 0))) (let ((.cse4 (not .cse6)) (.cse5 (not .cse7)) (.cse0 (not .cse8)) (.cse1 (not .cse9)) (.cse2 (or .cse8 .cse9)) (.cse3 (or .cse6 .cse7))) (and (= ~z$r_buff1_thd0~0_In-680645634 ~z$r_buff1_thd0~0_Out-680645634) (= ~z$r_buff0_thd0~0_In-680645634 ~z$r_buff0_thd0~0_Out-680645634) (or (and .cse0 (= ~z$w_buff1_used~0_Out-680645634 0) .cse1) (and .cse2 (= ~z$w_buff1_used~0_Out-680645634 ~z$w_buff1_used~0_In-680645634))) (or (and (= ~z$w_buff0_used~0_In-680645634 ~z$w_buff0_used~0_Out-680645634) .cse3) (and .cse4 .cse5 (= ~z$w_buff0_used~0_Out-680645634 0))) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In-680645634 0)) (or (and .cse4 .cse5 (= ~z~0_Out-680645634 ~z$w_buff0~0_In-680645634)) (and (or (and .cse0 .cse1 (= ~z$w_buff1~0_In-680645634 ~z~0_Out-680645634)) (and .cse2 (= ~z~0_In-680645634 ~z~0_Out-680645634))) .cse3))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-680645634, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-680645634, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-680645634, ~z$w_buff0~0=~z$w_buff0~0_In-680645634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-680645634, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-680645634, ~z$w_buff1~0=~z$w_buff1~0_In-680645634, ~z~0=~z~0_In-680645634} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out-680645634, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-680645634|, ~z$w_buff0~0=~z$w_buff0~0_In-680645634, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out-680645634, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-680645634|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-680645634|, ~z$w_buff1~0=~z$w_buff1~0_In-680645634, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-680645634|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-680645634|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out-680645634, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-680645634|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In-680645634, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-680645634, ~z~0=~z~0_Out-680645634} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite40, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0] because there is no mapped edge [2020-10-11 14:55:18,539 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-11 14:55:18,540 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,544 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-11 14:55:18,544 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,546 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-11 14:55:18,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,546 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-11 14:55:18,546 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,547 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-11 14:55:18,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,547 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-11 14:55:18,547 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,548 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-11 14:55:18,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,548 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-11 14:55:18,548 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,549 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-11 14:55:18,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,549 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-11 14:55:18,549 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,550 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-11 14:55:18,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,550 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-11 14:55:18,550 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,550 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-11 14:55:18,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,551 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-11 14:55:18,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,551 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-11 14:55:18,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,551 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-11 14:55:18,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,552 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-11 14:55:18,552 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,552 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-11 14:55:18,553 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,558 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-11 14:55:18,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,559 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-11 14:55:18,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,559 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-11 14:55:18,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,560 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-11 14:55:18,560 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:55:18,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:55:18 BasicIcfg [2020-10-11 14:55:18,649 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:55:18,651 INFO L168 Benchmark]: Toolchain (without parser) took 9566.76 ms. Allocated memory was 252.7 MB in the beginning and 508.6 MB in the end (delta: 255.9 MB). Free memory was 207.2 MB in the beginning and 152.6 MB in the end (delta: 54.6 MB). Peak memory consumption was 310.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:18,652 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 14:55:18,653 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.13 ms. Allocated memory was 252.7 MB in the beginning and 316.1 MB in the end (delta: 63.4 MB). Free memory was 207.2 MB in the beginning and 266.9 MB in the end (delta: -59.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:18,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.21 ms. Allocated memory is still 316.1 MB. Free memory was 266.9 MB in the beginning and 264.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:18,654 INFO L168 Benchmark]: Boogie Preprocessor took 46.70 ms. Allocated memory is still 316.1 MB. Free memory was 264.4 MB in the beginning and 261.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:18,655 INFO L168 Benchmark]: RCFGBuilder took 1878.89 ms. Allocated memory was 316.1 MB in the beginning and 359.7 MB in the end (delta: 43.5 MB). Free memory was 261.8 MB in the beginning and 236.2 MB in the end (delta: 25.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:18,656 INFO L168 Benchmark]: TraceAbstraction took 6854.08 ms. Allocated memory was 359.7 MB in the beginning and 508.6 MB in the end (delta: 148.9 MB). Free memory was 236.2 MB in the beginning and 152.6 MB in the end (delta: 83.6 MB). Peak memory consumption was 232.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:55:18,660 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.25 ms. Allocated memory is still 252.7 MB. Free memory is still 229.1 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 715.13 ms. Allocated memory was 252.7 MB in the beginning and 316.1 MB in the end (delta: 63.4 MB). Free memory was 207.2 MB in the beginning and 266.9 MB in the end (delta: -59.7 MB). Peak memory consumption was 32.1 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 66.21 ms. Allocated memory is still 316.1 MB. Free memory was 266.9 MB in the beginning and 264.4 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * Boogie Preprocessor took 46.70 ms. Allocated memory is still 316.1 MB. Free memory was 264.4 MB in the beginning and 261.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 1878.89 ms. Allocated memory was 316.1 MB in the beginning and 359.7 MB in the end (delta: 43.5 MB). Free memory was 261.8 MB in the beginning and 236.2 MB in the end (delta: 25.6 MB). Peak memory consumption was 99.8 MB. Max. memory is 14.2 GB. * TraceAbstraction took 6854.08 ms. Allocated memory was 359.7 MB in the beginning and 508.6 MB in the end (delta: 148.9 MB). Free memory was 236.2 MB in the beginning and 152.6 MB in the end (delta: 83.6 MB). Peak memory consumption was 232.5 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1433 VarBasedMoverChecksPositive, 52 VarBasedMoverChecksNegative, 14 SemBasedMoverChecksPositive, 38 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.9s, 167 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.0s, 118 PlacesBefore, 43 PlacesAfterwards, 107 TransitionsBefore, 30 TransitionsAfterwards, 2248 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 4878 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L699] 0 int __unbuffered_cnt = 0; [L701] 0 int __unbuffered_p2_EAX = 0; [L703] 0 int __unbuffered_p3_EAX = 0; [L705] 0 int a = 0; [L706] 0 _Bool main$tmp_guard0; [L707] 0 _Bool main$tmp_guard1; [L709] 0 int x = 0; [L711] 0 int y = 0; [L713] 0 int z = 0; [L714] 0 _Bool z$flush_delayed; [L715] 0 int z$mem_tmp; [L716] 0 _Bool z$r_buff0_thd0; [L717] 0 _Bool z$r_buff0_thd1; [L718] 0 _Bool z$r_buff0_thd2; [L719] 0 _Bool z$r_buff0_thd3; [L720] 0 _Bool z$r_buff0_thd4; [L721] 0 _Bool z$r_buff1_thd0; [L722] 0 _Bool z$r_buff1_thd1; [L723] 0 _Bool z$r_buff1_thd2; [L724] 0 _Bool z$r_buff1_thd3; [L725] 0 _Bool z$r_buff1_thd4; [L726] 0 _Bool z$read_delayed; [L727] 0 int *z$read_delayed_var; [L728] 0 int z$w_buff0; [L729] 0 _Bool z$w_buff0_used; [L730] 0 int z$w_buff1; [L731] 0 _Bool z$w_buff1_used; [L732] 0 _Bool weak$$choice0; [L733] 0 _Bool weak$$choice2; [L833] 0 pthread_t t1429; [L834] FCALL, FORK 0 pthread_create(&t1429, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] 0 pthread_t t1430; [L836] FCALL, FORK 0 pthread_create(&t1430, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 0 pthread_t t1431; [L838] FCALL, FORK 0 pthread_create(&t1431, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] 0 pthread_t t1432; [L840] FCALL, FORK 0 pthread_create(&t1432, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 4 z$w_buff1 = z$w_buff0 [L796] 4 z$w_buff0 = 1 [L797] 4 z$w_buff1_used = z$w_buff0_used [L798] 4 z$w_buff0_used = (_Bool)1 [L7] COND TRUE 4 !expression [L7] 4 __VERIFIER_error() [L800] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L801] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L802] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L803] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L804] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L805] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L740] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L747] 1 return 0; [L752] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 2 return 0; [L767] 3 y = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 3 z$flush_delayed = weak$$choice2 [L773] 3 z$mem_tmp = z [L774] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L774] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L775] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L775] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L776] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1 [L776] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L776] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L777] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L777] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L777] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L777] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L778] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0 [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L778] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L778] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L779] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L779] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L780] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L780] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L781] 3 __unbuffered_p2_EAX = z [L782] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L782] 3 z = z$flush_delayed ? z$mem_tmp : z [L783] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L811] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L813] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L813] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L814] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L814] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L815] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L815] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L788] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L790] 3 return 0; [L818] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 4 return 0; [L842] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.5s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 299 SDtfs, 401 SDslu, 379 SDs, 0 SdLazy, 123 SolverSat, 75 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2090occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 178 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 8268 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...