/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/mix007_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-11af1e5 [2020-10-11 14:39:04,819 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-11 14:39:04,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-11 14:39:04,861 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-11 14:39:04,862 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-11 14:39:04,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-11 14:39:04,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-11 14:39:04,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-11 14:39:04,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-11 14:39:04,883 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-11 14:39:04,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-11 14:39:04,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-11 14:39:04,884 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-11 14:39:04,887 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-11 14:39:04,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-11 14:39:04,890 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-11 14:39:04,891 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-11 14:39:04,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-11 14:39:04,894 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-11 14:39:04,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-11 14:39:04,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-11 14:39:04,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-11 14:39:04,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-11 14:39:04,908 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-11 14:39:04,910 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-11 14:39:04,911 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-11 14:39:04,911 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-11 14:39:04,911 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-11 14:39:04,912 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-11 14:39:04,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-11 14:39:04,922 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-11 14:39:04,923 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-11 14:39:04,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-11 14:39:04,924 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-11 14:39:04,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-11 14:39:04,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-11 14:39:04,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-11 14:39:04,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-11 14:39:04,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-11 14:39:04,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-11 14:39:04,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-11 14:39:04,931 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:39:04,952 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-11 14:39:04,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-11 14:39:04,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-11 14:39:04,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-11 14:39:04,954 INFO L138 SettingsManager]: * Use SBE=true [2020-10-11 14:39:04,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-11 14:39:04,955 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-11 14:39:04,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-11 14:39:04,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-11 14:39:04,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-11 14:39:04,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-11 14:39:04,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-11 14:39:04,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-11 14:39:04,956 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-11 14:39:04,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-11 14:39:04,956 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-11 14:39:04,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-11 14:39:04,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-11 14:39:04,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-11 14:39:04,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-11 14:39:04,958 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-11 14:39:04,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-11 14:39:04,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-11 14:39:04,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-11 14:39:04,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-11 14:39:04,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-11 14:39:04,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-11 14:39:04,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-11 14:39:04,959 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-11 14:39:04,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-11 14:39:05,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-11 14:39:05,243 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-11 14:39:05,247 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-11 14:39:05,248 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-11 14:39:05,249 INFO L275 PluginConnector]: CDTParser initialized [2020-10-11 14:39:05,249 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix007_pso.oepc.i [2020-10-11 14:39:05,305 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dedd2efd/fe416d5b8b884ebe8fe65c01863acc72/FLAGd7c302706 [2020-10-11 14:39:05,784 INFO L306 CDTParser]: Found 1 translation units. [2020-10-11 14:39:05,785 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix007_pso.oepc.i [2020-10-11 14:39:05,801 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dedd2efd/fe416d5b8b884ebe8fe65c01863acc72/FLAGd7c302706 [2020-10-11 14:39:06,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dedd2efd/fe416d5b8b884ebe8fe65c01863acc72 [2020-10-11 14:39:06,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-11 14:39:06,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-11 14:39:06,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-11 14:39:06,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-11 14:39:06,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-11 14:39:06,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:06,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b4d328 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06, skipping insertion in model container [2020-10-11 14:39:06,149 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:06,156 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-11 14:39:06,225 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-11 14:39:06,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:39:06,718 INFO L203 MainTranslator]: Completed pre-run [2020-10-11 14:39:06,846 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-11 14:39:06,953 INFO L208 MainTranslator]: Completed translation [2020-10-11 14:39:06,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06 WrapperNode [2020-10-11 14:39:06,955 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-11 14:39:06,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-11 14:39:06,956 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-11 14:39:06,956 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-11 14:39:06,966 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:39:06" (1/1) ... [2020-10-11 14:39:07,012 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:39:06" (1/1) ... [2020-10-11 14:39:07,043 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-11 14:39:07,044 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-11 14:39:07,044 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-11 14:39:07,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-11 14:39:07,054 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:07,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:07,059 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:07,059 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:07,070 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:07,074 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:07,078 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (1/1) ... [2020-10-11 14:39:07,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-11 14:39:07,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-11 14:39:07,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-11 14:39:07,084 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-11 14:39:07,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (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:39:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-11 14:39:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-11 14:39:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-11 14:39:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-11 14:39:07,168 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-11 14:39:07,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-11 14:39:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-11 14:39:07,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-11 14:39:07,169 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-11 14:39:07,169 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-11 14:39:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-11 14:39:07,170 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-11 14:39:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-11 14:39:07,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-11 14:39:07,170 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-11 14:39:07,172 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:39:09,515 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-11 14:39:09,516 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-11 14:39:09,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:09 BoogieIcfgContainer [2020-10-11 14:39:09,518 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-11 14:39:09,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-11 14:39:09,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-11 14:39:09,523 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-11 14:39:09,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:39:06" (1/3) ... [2020-10-11 14:39:09,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e98b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:09, skipping insertion in model container [2020-10-11 14:39:09,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:39:06" (2/3) ... [2020-10-11 14:39:09,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e98b692 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:39:09, skipping insertion in model container [2020-10-11 14:39:09,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:39:09" (3/3) ... [2020-10-11 14:39:09,527 INFO L111 eAbstractionObserver]: Analyzing ICFG mix007_pso.oepc.i [2020-10-11 14:39:09,539 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-11 14:39:09,539 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-11 14:39:09,549 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-11 14:39:09,550 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-11 14:39:09,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,598 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,598 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,599 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,599 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,602 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,603 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,603 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,603 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,604 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,605 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,605 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,606 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,607 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,608 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,609 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,610 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,610 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,610 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,611 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,611 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,611 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,612 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,613 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,614 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,615 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,616 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,617 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,618 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,619 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,620 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,621 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,622 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,623 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,636 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,636 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,637 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,643 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,643 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,645 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,646 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,646 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,647 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,649 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,649 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,652 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,652 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,652 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,653 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,654 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,655 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,656 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,657 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-11 14:39:09,674 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-11 14:39:09,693 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-11 14:39:09,693 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-11 14:39:09,693 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-11 14:39:09,693 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-11 14:39:09,693 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-11 14:39:09,693 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-11 14:39:09,693 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-11 14:39:09,693 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-11 14:39:09,708 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-11 14:39:09,711 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-11 14:39:09,714 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 115 transitions, 250 flow [2020-10-11 14:39:09,716 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 126 places, 115 transitions, 250 flow [2020-10-11 14:39:09,766 INFO L129 PetriNetUnfolder]: 2/111 cut-off events. [2020-10-11 14:39:09,766 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-11 14:39:09,773 INFO L80 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 93 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2020-10-11 14:39:09,777 INFO L117 LiptonReduction]: Number of co-enabled transitions 2824 [2020-10-11 14:39:09,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:09,892 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:09,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:09,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:09,899 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:09,899 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:09,904 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:09,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:09,928 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:09,928 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:09,929 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:09,930 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:09,934 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:09,934 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:09,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:09,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,011 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,012 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,017 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,017 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,020 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,041 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,049 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,049 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,219 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,219 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,237 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,237 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,239 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,239 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,300 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,303 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:39:10,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:10,305 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:39:10,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:10,307 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:39:10,307 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:10,309 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:39:10,309 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:10,312 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:39:10,312 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:10,313 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:39:10,314 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:10,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:39:10,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:39:10,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:39:10,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:10,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,390 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,390 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,391 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,393 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,410 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,411 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,411 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,412 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:10,414 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:10,414 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,416 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:10,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:10,821 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-11 14:39:10,945 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-11 14:39:11,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,011 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,032 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,036 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,037 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,039 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,074 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,092 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,093 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,093 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,094 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,099 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,179 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,187 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,214 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,512 WARN L193 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2020-10-11 14:39:11,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:39:11,616 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:39:11,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:39:11,620 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:11,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,659 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:39:11,659 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:11,661 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:39:11,661 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:11,663 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:39:11,664 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:11,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:39:11,666 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:11,668 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:39:11,668 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:11,669 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:39:11,670 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:11,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,719 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,720 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,722 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,722 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,724 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,724 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,741 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,744 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,944 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,945 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,945 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,946 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,947 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:11,949 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,949 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:11,964 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,964 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,965 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,965 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:11,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:11,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:11,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:11,998 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,002 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,023 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,025 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,025 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,027 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,030 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,058 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-11 14:39:12,433 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,538 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:39:12,539 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:39:12,541 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:39:12,541 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:12,575 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,576 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,577 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:39:12,578 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:12,579 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:39:12,579 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:12,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:39:12,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:12,582 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:39:12,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:12,584 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:39:12,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:12,585 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:39:12,586 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:12,617 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,619 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,619 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,635 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,636 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,636 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,637 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,638 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,638 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,640 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,640 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,743 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,744 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,762 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,763 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,763 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,765 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,765 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,767 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,767 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:39:12,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:12,819 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:39:12,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:12,820 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-11 14:39:12,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-11 14:39:12,822 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-11 14:39:12,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:12,823 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:39:12,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:12,825 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:39:12,825 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:12,861 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-11 14:39:12,861 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-11 14:39:12,863 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-11 14:39:12,864 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:12,890 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,891 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,891 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,893 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,912 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:12,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:12,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:12,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:12,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:13,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:13,084 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:13,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:13,100 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:13,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:13,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:13,212 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:13,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:13,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:13,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-11 14:39:13,229 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:13,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,232 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,232 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:13,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:13,234 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:13,255 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,258 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:13,259 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:13,260 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:13,302 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,303 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,304 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,305 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-11 14:39:13,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-11 14:39:13,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:13,308 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-11 14:39:13,308 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-11 14:39:14,186 WARN L193 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2020-10-11 14:39:14,324 WARN L193 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2020-10-11 14:39:14,335 INFO L132 LiptonReduction]: Checked pairs total: 9097 [2020-10-11 14:39:14,336 INFO L134 LiptonReduction]: Total number of compositions: 88 [2020-10-11 14:39:14,342 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 49 places, 37 transitions, 94 flow [2020-10-11 14:39:15,013 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6914 states. [2020-10-11 14:39:15,015 INFO L276 IsEmpty]: Start isEmpty. Operand 6914 states. [2020-10-11 14:39:15,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-11 14:39:15,022 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:15,022 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-11 14:39:15,023 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:15,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:15,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1200553, now seen corresponding path program 1 times [2020-10-11 14:39:15,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:15,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494286791] [2020-10-11 14:39:15,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:15,272 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:39:15,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494286791] [2020-10-11 14:39:15,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:15,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-11 14:39:15,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272498809] [2020-10-11 14:39:15,279 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-11 14:39:15,279 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-11 14:39:15,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-11 14:39:15,297 INFO L87 Difference]: Start difference. First operand 6914 states. Second operand 3 states. [2020-10-11 14:39:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:15,481 INFO L93 Difference]: Finished difference Result 5762 states and 23320 transitions. [2020-10-11 14:39:15,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-11 14:39:15,483 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-11 14:39:15,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:15,552 INFO L225 Difference]: With dead ends: 5762 [2020-10-11 14:39:15,552 INFO L226 Difference]: Without dead ends: 4862 [2020-10-11 14:39:15,553 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:39:15,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2020-10-11 14:39:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 4862. [2020-10-11 14:39:15,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4862 states. [2020-10-11 14:39:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4862 states to 4862 states and 19480 transitions. [2020-10-11 14:39:15,852 INFO L78 Accepts]: Start accepts. Automaton has 4862 states and 19480 transitions. Word has length 3 [2020-10-11 14:39:15,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:15,852 INFO L481 AbstractCegarLoop]: Abstraction has 4862 states and 19480 transitions. [2020-10-11 14:39:15,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-11 14:39:15,853 INFO L276 IsEmpty]: Start isEmpty. Operand 4862 states and 19480 transitions. [2020-10-11 14:39:15,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-11 14:39:15,857 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:15,857 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:15,857 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-11 14:39:15,858 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:15,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:15,858 INFO L82 PathProgramCache]: Analyzing trace with hash 240791798, now seen corresponding path program 1 times [2020-10-11 14:39:15,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:15,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386293125] [2020-10-11 14:39:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:15,973 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:39:15,974 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386293125] [2020-10-11 14:39:15,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:15,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:39:15,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473737645] [2020-10-11 14:39:15,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:39:15,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:15,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:39:15,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:39:15,979 INFO L87 Difference]: Start difference. First operand 4862 states and 19480 transitions. Second operand 4 states. [2020-10-11 14:39:16,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:16,069 INFO L93 Difference]: Finished difference Result 5162 states and 20060 transitions. [2020-10-11 14:39:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:39:16,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-11 14:39:16,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:16,113 INFO L225 Difference]: With dead ends: 5162 [2020-10-11 14:39:16,113 INFO L226 Difference]: Without dead ends: 4262 [2020-10-11 14:39:16,114 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:39:16,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4262 states. [2020-10-11 14:39:16,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4262 to 4262. [2020-10-11 14:39:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4262 states. [2020-10-11 14:39:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4262 states to 4262 states and 16820 transitions. [2020-10-11 14:39:16,265 INFO L78 Accepts]: Start accepts. Automaton has 4262 states and 16820 transitions. Word has length 12 [2020-10-11 14:39:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:16,267 INFO L481 AbstractCegarLoop]: Abstraction has 4262 states and 16820 transitions. [2020-10-11 14:39:16,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:39:16,267 INFO L276 IsEmpty]: Start isEmpty. Operand 4262 states and 16820 transitions. [2020-10-11 14:39:16,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-11 14:39:16,271 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:16,272 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:16,272 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-11 14:39:16,272 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:16,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:16,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1533080666, now seen corresponding path program 1 times [2020-10-11 14:39:16,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:16,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424179368] [2020-10-11 14:39:16,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:16,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:16,349 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:39:16,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424179368] [2020-10-11 14:39:16,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:16,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-11 14:39:16,350 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051935996] [2020-10-11 14:39:16,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:39:16,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:16,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:39:16,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:39:16,352 INFO L87 Difference]: Start difference. First operand 4262 states and 16820 transitions. Second operand 4 states. [2020-10-11 14:39:16,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:16,412 INFO L93 Difference]: Finished difference Result 4462 states and 17190 transitions. [2020-10-11 14:39:16,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:39:16,413 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-11 14:39:16,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:16,445 INFO L225 Difference]: With dead ends: 4462 [2020-10-11 14:39:16,445 INFO L226 Difference]: Without dead ends: 3862 [2020-10-11 14:39:16,446 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:39:16,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3862 states. [2020-10-11 14:39:16,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3862 to 3862. [2020-10-11 14:39:16,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3862 states. [2020-10-11 14:39:16,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3862 states to 3862 states and 15080 transitions. [2020-10-11 14:39:16,678 INFO L78 Accepts]: Start accepts. Automaton has 3862 states and 15080 transitions. Word has length 14 [2020-10-11 14:39:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:16,678 INFO L481 AbstractCegarLoop]: Abstraction has 3862 states and 15080 transitions. [2020-10-11 14:39:16,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:39:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3862 states and 15080 transitions. [2020-10-11 14:39:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-11 14:39:16,683 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:16,683 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:16,683 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-11 14:39:16,683 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:16,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:16,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1444846902, now seen corresponding path program 1 times [2020-10-11 14:39:16,684 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:16,684 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852177588] [2020-10-11 14:39:16,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:16,757 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:39:16,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852177588] [2020-10-11 14:39:16,758 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:16,758 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:39:16,758 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713552205] [2020-10-11 14:39:16,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:39:16,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:16,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:39:16,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:39:16,760 INFO L87 Difference]: Start difference. First operand 3862 states and 15080 transitions. Second operand 4 states. [2020-10-11 14:39:16,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:16,824 INFO L93 Difference]: Finished difference Result 3674 states and 12980 transitions. [2020-10-11 14:39:16,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:39:16,825 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-11 14:39:16,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:16,838 INFO L225 Difference]: With dead ends: 3674 [2020-10-11 14:39:16,838 INFO L226 Difference]: Without dead ends: 2774 [2020-10-11 14:39:16,838 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:39:16,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states. [2020-10-11 14:39:16,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2774. [2020-10-11 14:39:16,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2020-10-11 14:39:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 9640 transitions. [2020-10-11 14:39:16,922 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 9640 transitions. Word has length 16 [2020-10-11 14:39:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:16,923 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 9640 transitions. [2020-10-11 14:39:16,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:39:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 9640 transitions. [2020-10-11 14:39:16,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-11 14:39:16,928 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:16,928 INFO L421 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:16,928 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-11 14:39:16,929 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:16,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:16,929 INFO L82 PathProgramCache]: Analyzing trace with hash 2087655662, now seen corresponding path program 1 times [2020-10-11 14:39:16,929 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:16,930 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057119163] [2020-10-11 14:39:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:16,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:17,055 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:39:17,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057119163] [2020-10-11 14:39:17,056 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:17,056 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:39:17,056 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042013294] [2020-10-11 14:39:17,056 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:39:17,057 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:17,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:39:17,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:39:17,057 INFO L87 Difference]: Start difference. First operand 2774 states and 9640 transitions. Second operand 5 states. [2020-10-11 14:39:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:17,125 INFO L93 Difference]: Finished difference Result 2218 states and 7116 transitions. [2020-10-11 14:39:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-11 14:39:17,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-10-11 14:39:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:17,134 INFO L225 Difference]: With dead ends: 2218 [2020-10-11 14:39:17,134 INFO L226 Difference]: Without dead ends: 1718 [2020-10-11 14:39:17,135 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:39:17,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2020-10-11 14:39:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718. [2020-10-11 14:39:17,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1718 states. [2020-10-11 14:39:17,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 5416 transitions. [2020-10-11 14:39:17,183 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 5416 transitions. Word has length 19 [2020-10-11 14:39:17,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:17,183 INFO L481 AbstractCegarLoop]: Abstraction has 1718 states and 5416 transitions. [2020-10-11 14:39:17,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:39:17,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 5416 transitions. [2020-10-11 14:39:17,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-11 14:39:17,188 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:17,189 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] [2020-10-11 14:39:17,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-11 14:39:17,189 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:17,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:17,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1907450813, now seen corresponding path program 1 times [2020-10-11 14:39:17,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:17,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405172873] [2020-10-11 14:39:17,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:17,386 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:39:17,386 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405172873] [2020-10-11 14:39:17,387 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:17,387 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-11 14:39:17,387 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886516632] [2020-10-11 14:39:17,387 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-11 14:39:17,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:17,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-11 14:39:17,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-11 14:39:17,389 INFO L87 Difference]: Start difference. First operand 1718 states and 5416 transitions. Second operand 6 states. [2020-10-11 14:39:17,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:17,465 INFO L93 Difference]: Finished difference Result 1470 states and 4633 transitions. [2020-10-11 14:39:17,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:39:17,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-10-11 14:39:17,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:17,471 INFO L225 Difference]: With dead ends: 1470 [2020-10-11 14:39:17,472 INFO L226 Difference]: Without dead ends: 1330 [2020-10-11 14:39:17,472 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:39:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2020-10-11 14:39:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2020-10-11 14:39:17,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-10-11 14:39:17,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 4252 transitions. [2020-10-11 14:39:17,506 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 4252 transitions. Word has length 22 [2020-10-11 14:39:17,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:17,507 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 4252 transitions. [2020-10-11 14:39:17,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-11 14:39:17,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 4252 transitions. [2020-10-11 14:39:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 14:39:17,511 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:17,511 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, 1, 1] [2020-10-11 14:39:17,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-11 14:39:17,512 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:17,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:17,512 INFO L82 PathProgramCache]: Analyzing trace with hash 415161309, now seen corresponding path program 1 times [2020-10-11 14:39:17,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:17,512 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392774258] [2020-10-11 14:39:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:17,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:17,590 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:39:17,590 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392774258] [2020-10-11 14:39:17,590 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:17,591 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-11 14:39:17,591 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018714787] [2020-10-11 14:39:17,591 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-11 14:39:17,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-11 14:39:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-11 14:39:17,592 INFO L87 Difference]: Start difference. First operand 1330 states and 4252 transitions. Second operand 4 states. [2020-10-11 14:39:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:17,621 INFO L93 Difference]: Finished difference Result 1981 states and 6231 transitions. [2020-10-11 14:39:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-11 14:39:17,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2020-10-11 14:39:17,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:17,627 INFO L225 Difference]: With dead ends: 1981 [2020-10-11 14:39:17,627 INFO L226 Difference]: Without dead ends: 1336 [2020-10-11 14:39:17,627 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:39:17,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2020-10-11 14:39:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1330. [2020-10-11 14:39:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-10-11 14:39:17,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 4050 transitions. [2020-10-11 14:39:17,661 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 4050 transitions. Word has length 26 [2020-10-11 14:39:17,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:17,661 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 4050 transitions. [2020-10-11 14:39:17,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-11 14:39:17,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 4050 transitions. [2020-10-11 14:39:17,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-11 14:39:17,665 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:17,665 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, 1, 1] [2020-10-11 14:39:17,666 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-11 14:39:17,666 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:17,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:17,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1501798721, now seen corresponding path program 1 times [2020-10-11 14:39:17,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:17,667 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543818095] [2020-10-11 14:39:17,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:17,848 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:39:17,849 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543818095] [2020-10-11 14:39:17,849 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:17,849 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:39:17,850 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118927018] [2020-10-11 14:39:17,850 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-11 14:39:17,850 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:17,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-11 14:39:17,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:39:17,851 INFO L87 Difference]: Start difference. First operand 1330 states and 4050 transitions. Second operand 7 states. [2020-10-11 14:39:17,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:17,929 INFO L93 Difference]: Finished difference Result 1285 states and 3959 transitions. [2020-10-11 14:39:17,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:39:17,930 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2020-10-11 14:39:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:17,933 INFO L225 Difference]: With dead ends: 1285 [2020-10-11 14:39:17,934 INFO L226 Difference]: Without dead ends: 866 [2020-10-11 14:39:17,934 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:39:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2020-10-11 14:39:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 866. [2020-10-11 14:39:17,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2020-10-11 14:39:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 2654 transitions. [2020-10-11 14:39:17,955 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 2654 transitions. Word has length 26 [2020-10-11 14:39:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:17,955 INFO L481 AbstractCegarLoop]: Abstraction has 866 states and 2654 transitions. [2020-10-11 14:39:17,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-11 14:39:17,956 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 2654 transitions. [2020-10-11 14:39:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-11 14:39:17,958 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:17,959 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, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:17,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-11 14:39:17,959 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1420449853, now seen corresponding path program 1 times [2020-10-11 14:39:17,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:17,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265192662] [2020-10-11 14:39:17,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:18,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-11 14:39:18,070 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265192662] [2020-10-11 14:39:18,070 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:18,071 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:39:18,071 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242163282] [2020-10-11 14:39:18,071 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:39:18,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:18,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:39:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:39:18,072 INFO L87 Difference]: Start difference. First operand 866 states and 2654 transitions. Second operand 5 states. [2020-10-11 14:39:18,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:18,105 INFO L93 Difference]: Finished difference Result 1349 states and 4090 transitions. [2020-10-11 14:39:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:39:18,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-10-11 14:39:18,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:18,107 INFO L225 Difference]: With dead ends: 1349 [2020-10-11 14:39:18,107 INFO L226 Difference]: Without dead ends: 546 [2020-10-11 14:39:18,108 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:39:18,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2020-10-11 14:39:18,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2020-10-11 14:39:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2020-10-11 14:39:18,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 1572 transitions. [2020-10-11 14:39:18,120 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 1572 transitions. Word has length 30 [2020-10-11 14:39:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:18,122 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 1572 transitions. [2020-10-11 14:39:18,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:39:18,122 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 1572 transitions. [2020-10-11 14:39:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-11 14:39:18,126 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:18,126 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, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:18,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-11 14:39:18,127 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:18,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1364271265, now seen corresponding path program 2 times [2020-10-11 14:39:18,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:18,128 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380900866] [2020-10-11 14:39:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:18,260 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:39:18,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380900866] [2020-10-11 14:39:18,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:18,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-11 14:39:18,261 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763247150] [2020-10-11 14:39:18,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-11 14:39:18,262 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:18,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-11 14:39:18,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-11 14:39:18,262 INFO L87 Difference]: Start difference. First operand 546 states and 1572 transitions. Second operand 5 states. [2020-10-11 14:39:18,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:18,295 INFO L93 Difference]: Finished difference Result 684 states and 1953 transitions. [2020-10-11 14:39:18,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-11 14:39:18,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-10-11 14:39:18,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:18,297 INFO L225 Difference]: With dead ends: 684 [2020-10-11 14:39:18,297 INFO L226 Difference]: Without dead ends: 371 [2020-10-11 14:39:18,298 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-11 14:39:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2020-10-11 14:39:18,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 371. [2020-10-11 14:39:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2020-10-11 14:39:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 1022 transitions. [2020-10-11 14:39:18,306 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 1022 transitions. Word has length 30 [2020-10-11 14:39:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:18,307 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 1022 transitions. [2020-10-11 14:39:18,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-11 14:39:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 1022 transitions. [2020-10-11 14:39:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-11 14:39:18,308 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:18,308 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, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:18,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-11 14:39:18,309 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:18,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:18,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1763715907, now seen corresponding path program 3 times [2020-10-11 14:39:18,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:18,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161488792] [2020-10-11 14:39:18,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:18,631 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 18 [2020-10-11 14:39:18,682 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:39:18,683 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161488792] [2020-10-11 14:39:18,683 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:18,683 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:39:18,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322755473] [2020-10-11 14:39:18,684 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:39:18,684 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:39:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:39:18,685 INFO L87 Difference]: Start difference. First operand 371 states and 1022 transitions. Second operand 8 states. [2020-10-11 14:39:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:19,006 INFO L93 Difference]: Finished difference Result 604 states and 1612 transitions. [2020-10-11 14:39:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-11 14:39:19,006 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-10-11 14:39:19,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:19,008 INFO L225 Difference]: With dead ends: 604 [2020-10-11 14:39:19,008 INFO L226 Difference]: Without dead ends: 367 [2020-10-11 14:39:19,008 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2020-10-11 14:39:19,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2020-10-11 14:39:19,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 315. [2020-10-11 14:39:19,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-11 14:39:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 840 transitions. [2020-10-11 14:39:19,017 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 840 transitions. Word has length 30 [2020-10-11 14:39:19,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:19,017 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 840 transitions. [2020-10-11 14:39:19,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:39:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 840 transitions. [2020-10-11 14:39:19,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-11 14:39:19,020 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:19,020 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, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:19,020 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-11 14:39:19,020 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1347775293, now seen corresponding path program 4 times [2020-10-11 14:39:19,021 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:19,021 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958842939] [2020-10-11 14:39:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:19,265 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:39:19,265 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958842939] [2020-10-11 14:39:19,265 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:19,265 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-11 14:39:19,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905489426] [2020-10-11 14:39:19,267 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-11 14:39:19,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-11 14:39:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-11 14:39:19,268 INFO L87 Difference]: Start difference. First operand 315 states and 840 transitions. Second operand 8 states. [2020-10-11 14:39:19,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:19,459 INFO L93 Difference]: Finished difference Result 366 states and 959 transitions. [2020-10-11 14:39:19,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:39:19,460 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2020-10-11 14:39:19,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:19,461 INFO L225 Difference]: With dead ends: 366 [2020-10-11 14:39:19,463 INFO L226 Difference]: Without dead ends: 327 [2020-10-11 14:39:19,463 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-10-11 14:39:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-10-11 14:39:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 315. [2020-10-11 14:39:19,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2020-10-11 14:39:19,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 836 transitions. [2020-10-11 14:39:19,471 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 836 transitions. Word has length 30 [2020-10-11 14:39:19,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:19,471 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 836 transitions. [2020-10-11 14:39:19,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-11 14:39:19,471 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 836 transitions. [2020-10-11 14:39:19,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-11 14:39:19,472 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:19,473 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, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:19,473 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-11 14:39:19,473 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash -654031321, now seen corresponding path program 5 times [2020-10-11 14:39:19,474 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:19,474 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159583005] [2020-10-11 14:39:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:19,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-11 14:39:19,695 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:39:19,695 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159583005] [2020-10-11 14:39:19,695 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-11 14:39:19,696 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-10-11 14:39:19,696 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331776211] [2020-10-11 14:39:19,697 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-11 14:39:19,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-11 14:39:19,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-11 14:39:19,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-11 14:39:19,701 INFO L87 Difference]: Start difference. First operand 315 states and 836 transitions. Second operand 9 states. [2020-10-11 14:39:19,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-11 14:39:19,874 INFO L93 Difference]: Finished difference Result 456 states and 1163 transitions. [2020-10-11 14:39:19,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-11 14:39:19,875 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2020-10-11 14:39:19,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-11 14:39:19,876 INFO L225 Difference]: With dead ends: 456 [2020-10-11 14:39:19,876 INFO L226 Difference]: Without dead ends: 332 [2020-10-11 14:39:19,877 INFO L673 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2020-10-11 14:39:19,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2020-10-11 14:39:19,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 295. [2020-10-11 14:39:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2020-10-11 14:39:19,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 746 transitions. [2020-10-11 14:39:19,884 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 746 transitions. Word has length 30 [2020-10-11 14:39:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-11 14:39:19,884 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 746 transitions. [2020-10-11 14:39:19,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-11 14:39:19,884 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 746 transitions. [2020-10-11 14:39:19,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-10-11 14:39:19,885 INFO L413 BasicCegarLoop]: Found error trace [2020-10-11 14:39:19,885 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, 1, 1, 1, 1, 1, 1] [2020-10-11 14:39:19,885 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-11 14:39:19,885 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-11 14:39:19,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-11 14:39:19,886 INFO L82 PathProgramCache]: Analyzing trace with hash -307801859, now seen corresponding path program 6 times [2020-10-11 14:39:19,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-11 14:39:19,886 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691984148] [2020-10-11 14:39:19,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-11 14:39:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:39:19,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:39:20,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-11 14:39:20,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-11 14:39:20,048 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-11 14:39:20,048 INFO L519 BasicCegarLoop]: Counterexample might be feasible [2020-10-11 14:39:20,049 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-11 14:39:20,088 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:39:20,089 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,090 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:39:20,090 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,091 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:39:20,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,091 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:39:20,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,091 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:39:20,091 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,092 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:39:20,092 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,093 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:39:20,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,093 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:39:20,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,093 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:39:20,093 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,094 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:39:20,094 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,094 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:39:20,094 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,094 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:39:20,094 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,095 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:39:20,095 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,095 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:39:20,095 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,095 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:39:20,095 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,096 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:39:20,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,096 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:39:20,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,096 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:39:20,096 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,097 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:39:20,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,097 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:39:20,097 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,097 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:39:20,098 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,098 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:39:20,098 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,098 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:39:20,098 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,098 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:39:20,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,099 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:39:20,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,099 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:39:20,099 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,100 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:39:20,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,100 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:39:20,100 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,100 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:39:20,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,101 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:39:20,101 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,101 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:39:20,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,102 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:39:20,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,102 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:39:20,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,102 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:39:20,102 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,103 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:39:20,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,103 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:39:20,103 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,104 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:39:20,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,104 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:39:20,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,104 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:39:20,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,104 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:39:20,104 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,105 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:39:20,105 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-11 14:39:20,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:39:20 BasicIcfg [2020-10-11 14:39:20,192 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-11 14:39:20,194 INFO L168 Benchmark]: Toolchain (without parser) took 14054.47 ms. Allocated memory was 252.2 MB in the beginning and 580.4 MB in the end (delta: 328.2 MB). Free memory was 207.5 MB in the beginning and 250.5 MB in the end (delta: -43.0 MB). Peak memory consumption was 285.2 MB. Max. memory is 14.2 GB. [2020-10-11 14:39:20,195 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. [2020-10-11 14:39:20,195 INFO L168 Benchmark]: CACSL2BoogieTranslator took 814.35 ms. Allocated memory was 252.2 MB in the beginning and 317.2 MB in the end (delta: 65.0 MB). Free memory was 207.5 MB in the beginning and 263.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. [2020-10-11 14:39:20,196 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.71 ms. Allocated memory is still 317.2 MB. Free memory was 263.0 MB in the beginning and 260.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:39:20,197 INFO L168 Benchmark]: Boogie Preprocessor took 39.64 ms. Allocated memory is still 317.2 MB. Free memory was 260.4 MB in the beginning and 257.9 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:39:20,197 INFO L168 Benchmark]: RCFGBuilder took 2434.57 ms. Allocated memory was 317.2 MB in the beginning and 371.7 MB in the end (delta: 54.5 MB). Free memory was 257.9 MB in the beginning and 338.6 MB in the end (delta: -80.6 MB). Peak memory consumption was 139.5 MB. Max. memory is 14.2 GB. [2020-10-11 14:39:20,198 INFO L168 Benchmark]: TraceAbstraction took 10672.87 ms. Allocated memory was 371.7 MB in the beginning and 580.4 MB in the end (delta: 208.7 MB). Free memory was 338.6 MB in the beginning and 250.5 MB in the end (delta: 88.1 MB). Peak memory consumption was 296.8 MB. Max. memory is 14.2 GB. [2020-10-11 14:39:20,202 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 252.2 MB. Free memory is still 228.6 MB. There was no memory consumed. Max. memory is 14.2 GB. * CACSL2BoogieTranslator took 814.35 ms. Allocated memory was 252.2 MB in the beginning and 317.2 MB in the end (delta: 65.0 MB). Free memory was 207.5 MB in the beginning and 263.0 MB in the end (delta: -55.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 14.2 GB. * Boogie Procedure Inliner took 87.71 ms. Allocated memory is still 317.2 MB. Free memory was 263.0 MB in the beginning and 260.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 39.64 ms. Allocated memory is still 317.2 MB. Free memory was 260.4 MB in the beginning and 257.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 14.2 GB. * RCFGBuilder took 2434.57 ms. Allocated memory was 317.2 MB in the beginning and 371.7 MB in the end (delta: 54.5 MB). Free memory was 257.9 MB in the beginning and 338.6 MB in the end (delta: -80.6 MB). Peak memory consumption was 139.5 MB. Max. memory is 14.2 GB. * TraceAbstraction took 10672.87 ms. Allocated memory was 371.7 MB in the beginning and 580.4 MB in the end (delta: 208.7 MB). Free memory was 338.6 MB in the beginning and 250.5 MB in the end (delta: 88.1 MB). Peak memory consumption was 296.8 MB. Max. memory is 14.2 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1831 VarBasedMoverChecksPositive, 86 VarBasedMoverChecksNegative, 31 SemBasedMoverChecksPositive, 55 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 336 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 4.6s, 126 PlacesBefore, 49 PlacesAfterwards, 115 TransitionsBefore, 37 TransitionsAfterwards, 2824 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 88 TotalNumberOfCompositions, 9097 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_p0_EAX = 0; [L703] 0 int __unbuffered_p2_EAX = 0; [L705] 0 int __unbuffered_p2_EBX = 0; [L707] 0 int __unbuffered_p3_EAX = 0; [L709] 0 int __unbuffered_p3_EBX = 0; [L711] 0 int a = 0; [L712] 0 _Bool a$flush_delayed; [L713] 0 int a$mem_tmp; [L714] 0 _Bool a$r_buff0_thd0; [L715] 0 _Bool a$r_buff0_thd1; [L716] 0 _Bool a$r_buff0_thd2; [L717] 0 _Bool a$r_buff0_thd3; [L718] 0 _Bool a$r_buff0_thd4; [L719] 0 _Bool a$r_buff1_thd0; [L720] 0 _Bool a$r_buff1_thd1; [L721] 0 _Bool a$r_buff1_thd2; [L722] 0 _Bool a$r_buff1_thd3; [L723] 0 _Bool a$r_buff1_thd4; [L724] 0 _Bool a$read_delayed; [L725] 0 int *a$read_delayed_var; [L726] 0 int a$w_buff0; [L727] 0 _Bool a$w_buff0_used; [L728] 0 int a$w_buff1; [L729] 0 _Bool a$w_buff1_used; [L730] 0 _Bool main$tmp_guard0; [L731] 0 _Bool main$tmp_guard1; [L733] 0 int x = 0; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L860] 0 pthread_t t185; [L861] FCALL, FORK 0 pthread_create(&t185, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t186; [L863] FCALL, FORK 0 pthread_create(&t186, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L864] 0 pthread_t t187; [L865] FCALL, FORK 0 pthread_create(&t187, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t188; [L867] FCALL, FORK 0 pthread_create(&t188, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, 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] [L743] 1 a$w_buff1 = a$w_buff0 [L744] 1 a$w_buff0 = 1 [L745] 1 a$w_buff1_used = a$w_buff0_used [L746] 1 a$w_buff0_used = (_Bool)1 [L7] COND FALSE 1 !(!expression) [L748] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L749] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L750] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L751] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L752] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L753] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L773] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L796] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L799] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0] [L802] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L802] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L803] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L804] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L805] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L806] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L816] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L819] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1] [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L822] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 4 a$flush_delayed = weak$$choice2 [L825] 4 a$mem_tmp = a [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1 [L826] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L827] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L828] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L828] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L829] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L829] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L830] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L831] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L831] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L831] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L831] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L832] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L833] 4 __unbuffered_p3_EBX = a [L834] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L834] 4 a = a$flush_delayed ? a$mem_tmp : a [L835] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=2, z=1] [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] EXPR 1 a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a [L759] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L759] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L760] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L760] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L761] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L762] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L763] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L766] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L768] 1 return 0; [L779] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L779] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L780] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L780] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L781] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L782] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L783] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 2 return 0; [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L880] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 114 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.3s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 569 SDtfs, 723 SDslu, 1329 SDs, 0 SdLazy, 425 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6914occurred 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.9s AutomataMinimizationTime, 13 MinimizatonAttempts, 107 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 47596 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...