/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:28:10,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:28:10,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:28:10,934 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:28:10,935 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:28:10,937 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:28:10,939 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:28:10,942 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:28:10,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:28:10,946 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:28:10,947 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:28:10,949 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:28:10,950 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:28:10,952 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:28:10,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:28:10,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:28:10,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:28:10,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:28:10,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:28:10,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:28:10,993 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:28:10,997 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:28:10,998 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:28:11,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:28:11,003 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:28:11,003 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:28:11,004 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:28:11,005 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:28:11,006 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:28:11,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:28:11,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:28:11,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:28:11,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:28:11,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:28:11,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:28:11,013 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:28:11,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:28:11,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:28:11,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:28:11,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:28:11,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:28:11,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-11-09 15:28:11,049 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:28:11,049 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:28:11,051 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:28:11,051 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:28:11,052 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:28:11,052 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:28:11,052 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:28:11,053 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:28:11,053 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:28:11,053 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:28:11,053 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:28:11,053 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:28:11,054 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:28:11,054 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:28:11,054 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:28:11,054 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:28:11,055 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:28:11,055 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:28:11,055 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:28:11,055 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:28:11,056 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:28:11,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:28:11,056 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:28:11,056 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:28:11,057 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:28:11,057 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:28:11,057 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:28:11,057 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:28:11,057 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:28:11,058 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:28:11,058 INFO L138 SettingsManager]: * Interpolant automaton=MCR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-09 15:28:11,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:28:11,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:28:11,500 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:28:11,501 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:28:11,502 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:28:11,504 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi002_tso.opt.i [2020-11-09 15:28:11,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86995e335/00a441e9055f48fe91fcf8b2f8dfcc0a/FLAGbc39c6789 [2020-11-09 15:28:12,586 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:28:12,592 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi002_tso.opt.i [2020-11-09 15:28:12,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86995e335/00a441e9055f48fe91fcf8b2f8dfcc0a/FLAGbc39c6789 [2020-11-09 15:28:12,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86995e335/00a441e9055f48fe91fcf8b2f8dfcc0a [2020-11-09 15:28:12,750 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:28:12,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:28:12,766 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:28:12,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:28:12,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:28:12,772 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:12" (1/1) ... [2020-11-09 15:28:12,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8215f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:12, skipping insertion in model container [2020-11-09 15:28:12,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:28:12" (1/1) ... [2020-11-09 15:28:12,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:28:12,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:28:13,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:28:13,421 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:28:13,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:28:13,708 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:28:13,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13 WrapperNode [2020-11-09 15:28:13,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:28:13,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:28:13,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:28:13,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:28:13,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:28:13,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:28:13,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:28:13,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:28:13,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (1/1) ... [2020-11-09 15:28:13,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:28:13,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:28:13,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:28:13,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:28:13,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (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-11-09 15:28:13,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:28:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:28:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:28:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:28:13,988 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:28:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:28:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:28:13,989 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:28:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:28:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:28:13,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:28:13,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:28:13,992 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-09 15:28:19,984 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:28:19,984 INFO L298 CfgBuilder]: Removed 18 assume(true) statements. [2020-11-09 15:28:19,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:19 BoogieIcfgContainer [2020-11-09 15:28:19,988 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:28:19,989 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:28:19,990 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:28:19,994 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:28:19,994 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:28:12" (1/3) ... [2020-11-09 15:28:19,995 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bd969d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:28:19, skipping insertion in model container [2020-11-09 15:28:19,995 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:28:13" (2/3) ... [2020-11-09 15:28:19,996 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31bd969d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:28:19, skipping insertion in model container [2020-11-09 15:28:19,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:28:19" (3/3) ... [2020-11-09 15:28:19,998 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi002_tso.opt.i [2020-11-09 15:28:20,014 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:28:20,015 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:28:20,018 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-11-09 15:28:20,019 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:28:20,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,126 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,126 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,127 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,127 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,128 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,128 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,129 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,130 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,131 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,132 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,133 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,134 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,144 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,145 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,146 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,152 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,153 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,154 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,155 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,156 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,157 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,157 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,158 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,158 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,158 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,159 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,160 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,160 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,161 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,162 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,162 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,163 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,163 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,164 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,164 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,165 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,165 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,166 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,167 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,167 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,168 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,168 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,169 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,170 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,171 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,172 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,173 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,174 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,175 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,176 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,179 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,180 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,181 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,182 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,183 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,184 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,185 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,186 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,188 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,189 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,190 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,191 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,192 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,193 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,194 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,195 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,198 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,199 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,200 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,201 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,202 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,203 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,204 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,207 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,208 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,214 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,215 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,219 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,220 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,221 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,223 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,224 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,224 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,225 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,229 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,230 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,230 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,231 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,235 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,236 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,246 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,247 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite89| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,248 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite95| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite97| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite91| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite93| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite88| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,254 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,255 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite94| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,257 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite96| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite90| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,258 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite92| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,259 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:28:20,261 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:28:20,275 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 15:28:20,315 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:28:20,315 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:28:20,315 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:28:20,315 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:28:20,315 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:28:20,316 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:28:20,316 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:28:20,316 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:28:20,335 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:28:20,336 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 104 transitions, 218 flow [2020-11-09 15:28:20,340 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 104 transitions, 218 flow [2020-11-09 15:28:20,342 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 108 places, 104 transitions, 218 flow [2020-11-09 15:28:20,435 INFO L129 PetriNetUnfolder]: 3/102 cut-off events. [2020-11-09 15:28:20,436 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:28:20,442 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 102 events. 3/102 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 71 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2020-11-09 15:28:20,449 INFO L116 LiptonReduction]: Number of co-enabled transitions 1342 [2020-11-09 15:28:22,129 WARN L194 SmtUtils]: Spent 1.37 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-11-09 15:28:22,202 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-11-09 15:28:22,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:22,204 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-11-09 15:28:22,205 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:23,620 WARN L194 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 145 DAG size of output: 125 [2020-11-09 15:28:26,125 WARN L194 SmtUtils]: Spent 2.50 s on a formula simplification. DAG size of input: 312 DAG size of output: 267 [2020-11-09 15:28:26,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,144 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,149 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2020-11-09 15:28:26,151 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 3, 2, 1] term [2020-11-09 15:28:26,153 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,171 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,174 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,184 INFO L603 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2020-11-09 15:28:26,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 3, 2, 1] term [2020-11-09 15:28:26,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:28:26,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 1] term [2020-11-09 15:28:26,191 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,194 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-11-09 15:28:26,195 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 15:28:26,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:28:26,204 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,222 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,224 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,230 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,230 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,234 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:28:26,235 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,241 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,249 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:28:26,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,256 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,261 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,262 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:28:26,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,273 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:28:26,273 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,277 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:28:26,277 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,280 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,281 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:26,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:28:26,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:28:26,288 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:28:26,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:31,053 WARN L194 SmtUtils]: Spent 4.75 s on a formula simplification. DAG size of input: 368 DAG size of output: 286 [2020-11-09 15:28:32,540 WARN L194 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 110 [2020-11-09 15:28:32,822 WARN L194 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2020-11-09 15:28:34,456 WARN L194 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 208 DAG size of output: 162 [2020-11-09 15:28:34,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:28:34,459 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:34,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:28:34,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:28:35,790 WARN L194 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 176 DAG size of output: 166 [2020-11-09 15:28:36,303 WARN L194 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-11-09 15:28:36,436 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2020-11-09 15:28:36,629 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 48 [2020-11-09 15:28:38,247 WARN L194 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-09 15:28:38,576 WARN L194 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-11-09 15:28:39,258 WARN L194 SmtUtils]: Spent 677.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-09 15:28:39,954 WARN L194 SmtUtils]: Spent 692.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2020-11-09 15:28:40,356 WARN L194 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 15:28:40,544 WARN L194 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2020-11-09 15:28:41,922 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-09 15:28:42,031 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-09 15:28:42,429 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-09 15:28:42,530 WARN L194 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-09 15:28:43,078 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:28:43,289 WARN L194 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:28:43,501 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:28:43,715 WARN L194 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-11-09 15:28:44,605 WARN L194 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 140 [2020-11-09 15:28:45,027 WARN L194 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-11-09 15:28:45,848 WARN L194 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 140 [2020-11-09 15:28:46,250 WARN L194 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2020-11-09 15:28:46,256 INFO L131 LiptonReduction]: Checked pairs total: 4939 [2020-11-09 15:28:46,256 INFO L133 LiptonReduction]: Total number of compositions: 93 [2020-11-09 15:28:46,263 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 26 transitions, 62 flow [2020-11-09 15:28:46,294 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 392 states. [2020-11-09 15:28:46,300 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states. [2020-11-09 15:28:46,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-11-09 15:28:46,308 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:46,309 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-11-09 15:28:46,309 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:46,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:46,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2088630430, now seen corresponding path program 1 times [2020-11-09 15:28:46,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:46,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442579715] [2020-11-09 15:28:46,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:46,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:46,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442579715] [2020-11-09 15:28:46,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:46,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:28:46,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [634127547] [2020-11-09 15:28:46,647 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:46,652 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:46,666 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-11-09 15:28:46,666 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:46,674 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:46,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:28:46,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:46,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:28:46,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:28:46,696 INFO L87 Difference]: Start difference. First operand 392 states. Second operand 3 states. [2020-11-09 15:28:46,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:46,833 INFO L93 Difference]: Finished difference Result 350 states and 886 transitions. [2020-11-09 15:28:46,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:28:46,837 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-11-09 15:28:46,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:46,851 INFO L225 Difference]: With dead ends: 350 [2020-11-09 15:28:46,851 INFO L226 Difference]: Without dead ends: 290 [2020-11-09 15:28:46,853 INFO L677 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-11-09 15:28:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2020-11-09 15:28:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2020-11-09 15:28:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2020-11-09 15:28:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 716 transitions. [2020-11-09 15:28:46,928 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 716 transitions. Word has length 5 [2020-11-09 15:28:46,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:46,929 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 716 transitions. [2020-11-09 15:28:46,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:28:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 716 transitions. [2020-11-09 15:28:46,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-11-09 15:28:46,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:46,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-11-09 15:28:46,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:28:46,931 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:46,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:46,931 INFO L82 PathProgramCache]: Analyzing trace with hash -323031678, now seen corresponding path program 1 times [2020-11-09 15:28:46,938 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:46,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376640803] [2020-11-09 15:28:46,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:47,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:47,060 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376640803] [2020-11-09 15:28:47,060 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:47,060 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:28:47,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1235713689] [2020-11-09 15:28:47,060 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:47,061 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:47,063 INFO L252 McrAutomatonBuilder]: Finished intersection with 7 states and 6 transitions. [2020-11-09 15:28:47,063 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:47,063 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:47,068 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:28:47,068 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:47,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:28:47,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:28:47,069 INFO L87 Difference]: Start difference. First operand 290 states and 716 transitions. Second operand 3 states. [2020-11-09 15:28:47,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:47,182 INFO L93 Difference]: Finished difference Result 248 states and 603 transitions. [2020-11-09 15:28:47,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:28:47,187 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-11-09 15:28:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:47,192 INFO L225 Difference]: With dead ends: 248 [2020-11-09 15:28:47,192 INFO L226 Difference]: Without dead ends: 224 [2020-11-09 15:28:47,193 INFO L677 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-11-09 15:28:47,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2020-11-09 15:28:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2020-11-09 15:28:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-11-09 15:28:47,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 547 transitions. [2020-11-09 15:28:47,232 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 547 transitions. Word has length 6 [2020-11-09 15:28:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:47,233 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 547 transitions. [2020-11-09 15:28:47,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:28:47,233 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 547 transitions. [2020-11-09 15:28:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-11-09 15:28:47,236 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:47,236 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:47,236 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:28:47,236 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:47,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:47,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1195176961, now seen corresponding path program 1 times [2020-11-09 15:28:47,248 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:47,248 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391987716] [2020-11-09 15:28:47,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:47,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:47,391 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391987716] [2020-11-09 15:28:47,391 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:47,391 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:28:47,392 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1260511555] [2020-11-09 15:28:47,392 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:47,394 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:47,396 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-11-09 15:28:47,397 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:47,397 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:47,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:28:47,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:47,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:28:47,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:28:47,399 INFO L87 Difference]: Start difference. First operand 224 states and 547 transitions. Second operand 4 states. [2020-11-09 15:28:47,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:47,606 INFO L93 Difference]: Finished difference Result 254 states and 590 transitions. [2020-11-09 15:28:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:28:47,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-11-09 15:28:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:47,610 INFO L225 Difference]: With dead ends: 254 [2020-11-09 15:28:47,610 INFO L226 Difference]: Without dead ends: 212 [2020-11-09 15:28:47,610 INFO L677 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-11-09 15:28:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-11-09 15:28:47,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2020-11-09 15:28:47,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2020-11-09 15:28:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 513 transitions. [2020-11-09 15:28:47,624 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 513 transitions. Word has length 8 [2020-11-09 15:28:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:47,624 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 513 transitions. [2020-11-09 15:28:47,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:28:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 513 transitions. [2020-11-09 15:28:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-09 15:28:47,625 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:47,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:47,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:28:47,626 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:47,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:47,627 INFO L82 PathProgramCache]: Analyzing trace with hash 1604247035, now seen corresponding path program 1 times [2020-11-09 15:28:47,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:47,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080096300] [2020-11-09 15:28:47,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:47,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080096300] [2020-11-09 15:28:47,762 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:47,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:28:47,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1230527354] [2020-11-09 15:28:47,762 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:47,765 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:47,767 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-11-09 15:28:47,767 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:47,767 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:47,768 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:28:47,768 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:47,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:28:47,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:28:47,769 INFO L87 Difference]: Start difference. First operand 212 states and 513 transitions. Second operand 5 states. [2020-11-09 15:28:48,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:48,028 INFO L93 Difference]: Finished difference Result 224 states and 517 transitions. [2020-11-09 15:28:48,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:28:48,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-11-09 15:28:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:48,032 INFO L225 Difference]: With dead ends: 224 [2020-11-09 15:28:48,032 INFO L226 Difference]: Without dead ends: 188 [2020-11-09 15:28:48,032 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:28:48,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2020-11-09 15:28:48,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2020-11-09 15:28:48,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2020-11-09 15:28:48,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 445 transitions. [2020-11-09 15:28:48,044 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 445 transitions. Word has length 9 [2020-11-09 15:28:48,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:48,044 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 445 transitions. [2020-11-09 15:28:48,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:28:48,045 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 445 transitions. [2020-11-09 15:28:48,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:28:48,046 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:48,046 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:48,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:28:48,047 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:48,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:48,047 INFO L82 PathProgramCache]: Analyzing trace with hash -212526084, now seen corresponding path program 1 times [2020-11-09 15:28:48,056 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:48,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244128314] [2020-11-09 15:28:48,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:48,271 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244128314] [2020-11-09 15:28:48,271 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:48,272 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:28:48,272 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438034501] [2020-11-09 15:28:48,272 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:48,276 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:48,281 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 15:28:48,281 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:48,281 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:48,282 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:28:48,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:48,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:28:48,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:28:48,283 INFO L87 Difference]: Start difference. First operand 188 states and 445 transitions. Second operand 5 states. [2020-11-09 15:28:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:48,440 INFO L93 Difference]: Finished difference Result 188 states and 429 transitions. [2020-11-09 15:28:48,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:28:48,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-11-09 15:28:48,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:48,443 INFO L225 Difference]: With dead ends: 188 [2020-11-09 15:28:48,443 INFO L226 Difference]: Without dead ends: 164 [2020-11-09 15:28:48,443 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:28:48,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2020-11-09 15:28:48,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2020-11-09 15:28:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-11-09 15:28:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 379 transitions. [2020-11-09 15:28:48,449 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 379 transitions. Word has length 11 [2020-11-09 15:28:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:48,450 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 379 transitions. [2020-11-09 15:28:48,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:28:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 379 transitions. [2020-11-09 15:28:48,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:28:48,452 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:48,452 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:48,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:28:48,452 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:48,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:48,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1783661429, now seen corresponding path program 1 times [2020-11-09 15:28:48,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:48,459 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983503691] [2020-11-09 15:28:48,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:48,972 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983503691] [2020-11-09 15:28:48,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:48,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 15:28:48,973 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399183505] [2020-11-09 15:28:48,973 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:48,981 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:48,999 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 32 transitions. [2020-11-09 15:28:48,999 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:49,041 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 1] term [2020-11-09 15:28:49,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,042 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:28:49,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,043 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 3, 1] term [2020-11-09 15:28:49,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,045 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,045 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,046 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 2, 3, 1] term [2020-11-09 15:28:49,046 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 2, 3, 1] term [2020-11-09 15:28:49,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,054 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:49,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,058 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 3, 4, 3, 3, 3, 2, 3, 2, 3, 1] term [2020-11-09 15:28:49,058 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,060 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 3, 4, 3, 3, 3, 2, 3, 2, 3, 1] term [2020-11-09 15:28:49,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:49,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,096 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,103 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,104 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,106 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:28:49,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,107 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,107 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,108 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,492 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 29 [2020-11-09 15:28:49,532 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:49,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,534 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,536 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,536 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,537 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,537 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,538 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:28:49,538 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,539 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,539 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,540 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,540 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:49,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,557 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:28:49,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 1] term [2020-11-09 15:28:49,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:49,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 3, 4, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:49,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,860 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,861 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,862 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,863 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,864 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,864 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,865 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:28:49,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,866 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,867 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:49,867 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:49,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,880 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:28:49,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,880 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 1] term [2020-11-09 15:28:49,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,882 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,883 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,885 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,886 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:49,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,897 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:49,899 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 4, 3, 4, 3, 3, 3, 2, 3, 1] term [2020-11-09 15:28:49,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:28:50,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:28:50,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:50,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 3, 1] term [2020-11-09 15:28:50,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:50,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:28:50,102 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,610 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 30 [2020-11-09 15:28:50,629 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:28:50,630 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,631 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:28:50,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,632 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:50,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,633 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 3, 1] term [2020-11-09 15:28:50,634 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:50,635 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:28:50,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,929 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:28:50,930 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,930 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:28:50,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:50,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:50,933 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 5, 3, 1] term [2020-11-09 15:28:50,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:50,935 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:28:50,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:51,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [4352#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~x$w_buff1~0 1)) (= (mod ~x$w_buff1_used~0 256) 0)) (or (= ~x~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~x$w_buff0~0 1))) (or (= 0 ~x$w_buff1~0) (not (= ~x~0 1))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~x~0 1)))), 4353#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~x$w_buff0~0 1)) (= (mod ~x$w_buff1_used~0 256) 0)) (or (= ~x~0 1) (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~x$w_buff0~0 1))) (or (= 0 ~x$w_buff1~0) (not (= ~x~0 1))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~x~0 1))) (or (not (= ~x$w_buff1~0 1)) (= (mod ~x$w_buff1_used~0 256) 0))), 4354#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~x$w_buff0~0 1)) (= (mod ~x$w_buff1_used~0 256) 0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (= 0 ~x$w_buff1~0))] [2020-11-09 15:28:51,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 15:28:51,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:51,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 15:28:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:28:51,274 INFO L87 Difference]: Start difference. First operand 164 states and 379 transitions. Second operand 12 states. [2020-11-09 15:28:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:51,767 INFO L93 Difference]: Finished difference Result 214 states and 489 transitions. [2020-11-09 15:28:51,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:28:51,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2020-11-09 15:28:51,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:51,773 INFO L225 Difference]: With dead ends: 214 [2020-11-09 15:28:51,773 INFO L226 Difference]: Without dead ends: 200 [2020-11-09 15:28:51,773 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2020-11-09 15:28:51,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-11-09 15:28:51,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 191. [2020-11-09 15:28:51,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2020-11-09 15:28:51,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 442 transitions. [2020-11-09 15:28:51,782 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 442 transitions. Word has length 14 [2020-11-09 15:28:51,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:51,782 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 442 transitions. [2020-11-09 15:28:51,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 15:28:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 442 transitions. [2020-11-09 15:28:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:28:51,785 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:51,785 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:51,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:28:51,785 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash -728383947, now seen corresponding path program 2 times [2020-11-09 15:28:51,787 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:51,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432878144] [2020-11-09 15:28:51,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:52,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:52,073 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432878144] [2020-11-09 15:28:52,074 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:52,074 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:28:52,074 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [542055183] [2020-11-09 15:28:52,074 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:52,080 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:52,093 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 30 transitions. [2020-11-09 15:28:52,093 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:52,099 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:28:52,099 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,100 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:52,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,101 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:28:52,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,150 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:52,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,151 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:52,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:28:52,153 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,213 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:52,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,214 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:52,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,215 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:28:52,215 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,216 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:52,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,217 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:52,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,218 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:52,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:28:52,220 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,220 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:52,221 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,221 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:52,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,311 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:52,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:28:52,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,313 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:28:52,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,353 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:28:52,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:52,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:52,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:28:52,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:52,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:28:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:28:52,365 INFO L87 Difference]: Start difference. First operand 191 states and 442 transitions. Second operand 6 states. [2020-11-09 15:28:52,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:52,676 INFO L93 Difference]: Finished difference Result 222 states and 504 transitions. [2020-11-09 15:28:52,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:28:52,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-11-09 15:28:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:52,682 INFO L225 Difference]: With dead ends: 222 [2020-11-09 15:28:52,682 INFO L226 Difference]: Without dead ends: 207 [2020-11-09 15:28:52,683 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:28:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-11-09 15:28:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 189. [2020-11-09 15:28:52,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-11-09 15:28:52,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 433 transitions. [2020-11-09 15:28:52,689 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 433 transitions. Word has length 14 [2020-11-09 15:28:52,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:52,690 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 433 transitions. [2020-11-09 15:28:52,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:28:52,690 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 433 transitions. [2020-11-09 15:28:52,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:28:52,691 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:52,691 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:52,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:28:52,692 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:52,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:52,692 INFO L82 PathProgramCache]: Analyzing trace with hash -541089515, now seen corresponding path program 1 times [2020-11-09 15:28:52,698 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:52,699 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127335077] [2020-11-09 15:28:52,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:52,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:52,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127335077] [2020-11-09 15:28:52,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:52,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:28:52,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2089791746] [2020-11-09 15:28:52,856 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:52,862 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:52,875 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 33 transitions. [2020-11-09 15:28:52,876 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:52,877 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:28:52,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:28:52,878 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:52,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:28:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:28:52,879 INFO L87 Difference]: Start difference. First operand 189 states and 433 transitions. Second operand 5 states. [2020-11-09 15:28:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:28:53,070 INFO L93 Difference]: Finished difference Result 279 states and 629 transitions. [2020-11-09 15:28:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:28:53,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-09 15:28:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:28:53,073 INFO L225 Difference]: With dead ends: 279 [2020-11-09 15:28:53,073 INFO L226 Difference]: Without dead ends: 199 [2020-11-09 15:28:53,073 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:28:53,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-09 15:28:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2020-11-09 15:28:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2020-11-09 15:28:53,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 439 transitions. [2020-11-09 15:28:53,081 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 439 transitions. Word has length 15 [2020-11-09 15:28:53,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:28:53,081 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 439 transitions. [2020-11-09 15:28:53,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:28:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 439 transitions. [2020-11-09 15:28:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:28:53,082 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:28:53,082 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:28:53,082 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:28:53,083 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:28:53,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:28:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash -541099125, now seen corresponding path program 1 times [2020-11-09 15:28:53,085 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:28:53,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363668194] [2020-11-09 15:28:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:28:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:28:53,861 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 30 [2020-11-09 15:28:53,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:28:53,965 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363668194] [2020-11-09 15:28:53,965 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:28:53,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:28:53,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2137379365] [2020-11-09 15:28:53,965 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:28:53,971 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:28:53,982 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 37 transitions. [2020-11-09 15:28:53,983 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:28:54,034 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 3, 4, 3, 3, 2, 1] term [2020-11-09 15:28:54,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:54,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 1] term [2020-11-09 15:28:54,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,047 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 5, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,048 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,049 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,049 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,052 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,053 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,054 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,055 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,055 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,063 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:54,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,064 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:54,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:54,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,068 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:54,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,070 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:54,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,071 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:54,071 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,073 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[9, 4, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:54,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,074 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,075 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,076 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,076 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,077 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,078 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,079 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,079 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,082 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,086 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,093 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:54,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:54,098 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:54,098 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:55,822 WARN L194 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 32 [2020-11-09 15:28:55,837 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 3, 2, 1] term [2020-11-09 15:28:55,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:55,837 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 1] term [2020-11-09 15:28:55,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:55,839 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 6, 4, 6, 4, 1] term [2020-11-09 15:28:55,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:55,840 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 6, 4, 6, 4, 1] term [2020-11-09 15:28:55,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:55,841 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 15:28:55,841 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,534 WARN L194 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 33 [2020-11-09 15:28:56,638 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:56,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,640 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:56,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,640 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 1] term [2020-11-09 15:28:56,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,652 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,652 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,659 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:56,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,669 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:56,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:56,670 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,672 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:56,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,673 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:56,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,675 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:56,675 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,677 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[9, 4, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:56,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,678 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,679 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,680 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,681 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,681 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,683 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,685 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,688 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,688 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,689 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,690 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,692 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,694 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:56,696 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,696 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,697 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,698 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:56,699 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:56,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,167 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:58,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:58,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 3, 1] term [2020-11-09 15:28:58,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,174 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,175 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,176 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,178 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,179 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,187 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:58,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:58,188 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:58,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:58,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:58,189 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:58,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:58,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,192 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:58,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:58,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,194 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[9, 4, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:28:58,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,195 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,198 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,199 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,201 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,201 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,202 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,202 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:58,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,205 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:58,206 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:58,207 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:58,209 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,209 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:58,211 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,211 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:58,212 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 4, 4, 4, 3, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 2, 3, 1] term [2020-11-09 15:28:58,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:59,359 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 3, 2, 1] term [2020-11-09 15:28:59,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,360 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 1] term [2020-11-09 15:28:59,360 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,362 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 6, 4, 6, 4, 1] term [2020-11-09 15:28:59,362 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:59,363 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 6, 4, 6, 4, 1] term [2020-11-09 15:28:59,364 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,365 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 15:28:59,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,588 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 3, 2, 1] term [2020-11-09 15:28:59,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,590 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 6, 4, 2, 1] term [2020-11-09 15:28:59,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,594 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 6, 4, 6, 4, 1] term [2020-11-09 15:28:59,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:28:59,596 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 6, 4, 6, 4, 1] term [2020-11-09 15:28:59,596 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,598 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 6, 4, 2, 3, 2, 1] term [2020-11-09 15:28:59,598 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,817 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:28:59,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,818 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:59,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,818 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:28:59,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,819 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:59,820 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,820 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:59,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,821 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:59,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,822 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:28:59,822 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,823 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:59,824 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,824 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:28:59,825 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:28:59,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:28:59,969 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6265#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~x$w_buff1~0 1)) (= (mod ~x$w_buff1_used~0 256) 0) (= ~x~0 ~x$w_buff1~0)) (or (not (= 2 ~x$w_buff1~0)) (not (= ~x~0 1))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~x~0 1))) (<= ~x$r_buff0_thd1~0 0) (< 0 (+ ~x$r_buff0_thd1~0 1))), 6266#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= ~x$w_buff1~0 1)) (= (mod ~x$w_buff1_used~0 256) 0) (= ~x~0 ~x$w_buff1~0)) (or (not (= 2 ~x$w_buff1~0)) (not (= ~x~0 1))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~x$w_buff0~0)) (not (= ~x~0 1))) (or (not (= 2 ~x$w_buff0~0)) (not (= ~x$w_buff1~0 1)) (= (mod ~x$w_buff1_used~0 256) 0)) (<= ~x$r_buff0_thd1~0 0) (< 0 (+ ~x$r_buff0_thd1~0 1))), 6267#(and (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (<= ~x$r_buff0_thd1~0 0) (not (= 2 ~x$w_buff1~0)) (< 0 (+ ~x$r_buff0_thd1~0 1)))] [2020-11-09 15:28:59,970 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-09 15:28:59,970 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:28:59,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-09 15:28:59,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2020-11-09 15:28:59,971 INFO L87 Difference]: Start difference. First operand 199 states and 439 transitions. Second operand 13 states. [2020-11-09 15:29:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:00,708 INFO L93 Difference]: Finished difference Result 228 states and 496 transitions. [2020-11-09 15:29:00,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:29:00,711 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-11-09 15:29:00,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:00,713 INFO L225 Difference]: With dead ends: 228 [2020-11-09 15:29:00,713 INFO L226 Difference]: Without dead ends: 220 [2020-11-09 15:29:00,714 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2020-11-09 15:29:00,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2020-11-09 15:29:00,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 214. [2020-11-09 15:29:00,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2020-11-09 15:29:00,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 475 transitions. [2020-11-09 15:29:00,725 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 475 transitions. Word has length 15 [2020-11-09 15:29:00,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:00,725 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 475 transitions. [2020-11-09 15:29:00,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-09 15:29:00,725 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 475 transitions. [2020-11-09 15:29:00,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:29:00,726 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:00,726 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:00,726 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:29:00,727 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:00,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:00,727 INFO L82 PathProgramCache]: Analyzing trace with hash -538116285, now seen corresponding path program 2 times [2020-11-09 15:29:00,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:00,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196679085] [2020-11-09 15:29:00,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:01,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:01,239 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196679085] [2020-11-09 15:29:01,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:01,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:29:01,240 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [241347004] [2020-11-09 15:29:01,240 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:01,244 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:01,255 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 35 transitions. [2020-11-09 15:29:01,255 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:01,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:01,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,301 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,301 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,301 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:01,303 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,303 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,304 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,305 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,309 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:01,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:01,310 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,310 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:29:01,311 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,494 WARN L194 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 23 [2020-11-09 15:29:01,502 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:29:01,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,503 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:01,503 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,507 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:01,507 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 3, 1] term [2020-11-09 15:29:01,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:01,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:29:01,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,770 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2020-11-09 15:29:01,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:29:01,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:29:01,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,787 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:01,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,787 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-09 15:29:01,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,788 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:01,788 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,789 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:01,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,789 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:01,790 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,810 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:01,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,811 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,812 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,813 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,815 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,816 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:01,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,817 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,818 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:01,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,872 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:29:01,872 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:01,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,874 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:01,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:01,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 3, 1] term [2020-11-09 15:29:01,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:01,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:29:01,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,085 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:02,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,086 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:02,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,087 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:02,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,088 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:02,088 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:02,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,089 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:02,089 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:02,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:02,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:02,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,094 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:02,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,096 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:02,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,097 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:29:02,097 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:29:02,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:02,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,195 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:02,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,196 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 3, 4, 3, 1] term [2020-11-09 15:29:02,196 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:02,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:29:02,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:02,363 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [6940#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~x$w_buff0~0))) (= 0 ~x$r_buff0_thd0~0) (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~x$w_buff1~0)) (= (mod ~x$w_buff1_used~0 256) 0)) (not (= 2 ~x~0))), 6941#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~x$w_buff0~0))) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x~0)) (or (not (= 2 ~x$w_buff1~0)) (= (mod ~x$w_buff1_used~0 256) 0))), 6942#(and (or (= (mod ~x$w_buff0_used~0 256) 0) (not (= 2 ~x$w_buff0~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~x$w_buff1~0)) (= (mod ~x$w_buff1_used~0 256) 0)))] [2020-11-09 15:29:02,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-09 15:29:02,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:02,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-09 15:29:02,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-11-09 15:29:02,365 INFO L87 Difference]: Start difference. First operand 214 states and 475 transitions. Second operand 13 states. [2020-11-09 15:29:02,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:02,974 INFO L93 Difference]: Finished difference Result 239 states and 517 transitions. [2020-11-09 15:29:02,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 15:29:02,976 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-11-09 15:29:02,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:02,977 INFO L225 Difference]: With dead ends: 239 [2020-11-09 15:29:02,977 INFO L226 Difference]: Without dead ends: 228 [2020-11-09 15:29:02,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2020-11-09 15:29:02,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2020-11-09 15:29:02,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 222. [2020-11-09 15:29:02,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2020-11-09 15:29:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 487 transitions. [2020-11-09 15:29:02,986 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 487 transitions. Word has length 15 [2020-11-09 15:29:02,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:02,987 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 487 transitions. [2020-11-09 15:29:02,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-09 15:29:02,987 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 487 transitions. [2020-11-09 15:29:02,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:29:02,988 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:02,988 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:02,988 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:29:02,988 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:02,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:02,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1105084843, now seen corresponding path program 3 times [2020-11-09 15:29:02,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:02,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857409951] [2020-11-09 15:29:02,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:03,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857409951] [2020-11-09 15:29:03,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:03,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:29:03,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [896033809] [2020-11-09 15:29:03,468 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:03,473 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:03,484 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 31 transitions. [2020-11-09 15:29:03,484 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:03,500 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:29:03,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,501 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:03,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,507 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:03,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:03,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:29:03,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,788 WARN L194 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 22 [2020-11-09 15:29:03,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:29:03,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,794 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:03,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,800 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:03,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:03,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,802 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:29:03,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,892 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:03,892 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,896 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:03,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,898 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:29:03,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,902 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 3, 2, 1] term [2020-11-09 15:29:03,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:03,903 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:03,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,018 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:04,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,018 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:04,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,019 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:04,020 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:04,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,021 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:04,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:04,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:04,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:04,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,025 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:04,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,103 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:04,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:04,172 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [7640#(and (= ~x~0 1) (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (= 0 ~x$w_buff1~0) (= (mod ~x$w_buff1_used~0 256) 0)), 7641#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff0~0)) (= 0 ~x$w_buff1~0) (= (mod ~x$w_buff1_used~0 256) 0))] [2020-11-09 15:29:04,172 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-09 15:29:04,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:04,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-09 15:29:04,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:29:04,174 INFO L87 Difference]: Start difference. First operand 222 states and 487 transitions. Second operand 12 states. [2020-11-09 15:29:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:04,756 INFO L93 Difference]: Finished difference Result 249 states and 544 transitions. [2020-11-09 15:29:04,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-09 15:29:04,762 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-11-09 15:29:04,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:04,763 INFO L225 Difference]: With dead ends: 249 [2020-11-09 15:29:04,764 INFO L226 Difference]: Without dead ends: 240 [2020-11-09 15:29:04,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-11-09 15:29:04,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2020-11-09 15:29:04,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2020-11-09 15:29:04,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-11-09 15:29:04,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 517 transitions. [2020-11-09 15:29:04,777 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 517 transitions. Word has length 15 [2020-11-09 15:29:04,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:04,777 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 517 transitions. [2020-11-09 15:29:04,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-09 15:29:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 517 transitions. [2020-11-09 15:29:04,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:29:04,778 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:04,778 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:04,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 15:29:04,779 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:04,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:04,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1105094453, now seen corresponding path program 2 times [2020-11-09 15:29:04,781 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:04,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905926460] [2020-11-09 15:29:04,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:05,365 WARN L194 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 26 [2020-11-09 15:29:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:05,421 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905926460] [2020-11-09 15:29:05,421 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:05,421 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:29:05,421 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1554329245] [2020-11-09 15:29:05,421 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:05,428 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:05,444 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 35 transitions. [2020-11-09 15:29:05,444 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:05,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:05,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 3, 2, 2, 1] term [2020-11-09 15:29:05,453 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:05,454 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 4, 3, 2, 2, 1] term [2020-11-09 15:29:05,454 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,530 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:05,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,531 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 3, 2, 2, 1] term [2020-11-09 15:29:05,532 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:05,532 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 4, 3, 2, 2, 1] term [2020-11-09 15:29:05,533 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,638 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:05,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,639 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,640 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:05,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,646 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,647 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,726 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:05,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,766 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:05,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,767 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,768 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,768 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,769 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,769 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,770 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,771 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,772 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:05,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,774 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:05,775 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:29:05,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,779 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:05,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,783 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:05,783 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:05,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:29:05,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,959 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:05,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,960 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:05,960 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,961 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:29:05,961 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,963 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:29:05,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:05,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:05,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:05,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:06,040 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:06,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:06,041 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 3, 2, 2, 1] term [2020-11-09 15:29:06,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:06,042 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 4, 3, 2, 2, 1] term [2020-11-09 15:29:06,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:06,105 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:29:06,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:29:06,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:06,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:29:06,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:29:06,106 INFO L87 Difference]: Start difference. First operand 234 states and 517 transitions. Second operand 7 states. [2020-11-09 15:29:06,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:06,741 INFO L93 Difference]: Finished difference Result 265 states and 573 transitions. [2020-11-09 15:29:06,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:29:06,743 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 15:29:06,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:06,746 INFO L225 Difference]: With dead ends: 265 [2020-11-09 15:29:06,746 INFO L226 Difference]: Without dead ends: 223 [2020-11-09 15:29:06,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2020-11-09 15:29:06,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2020-11-09 15:29:06,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 200. [2020-11-09 15:29:06,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-11-09 15:29:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 443 transitions. [2020-11-09 15:29:06,754 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 443 transitions. Word has length 15 [2020-11-09 15:29:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:06,754 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 443 transitions. [2020-11-09 15:29:06,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:29:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 443 transitions. [2020-11-09 15:29:06,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:29:06,755 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:06,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:06,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 15:29:06,756 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:06,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:06,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1280911629, now seen corresponding path program 4 times [2020-11-09 15:29:06,767 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:06,768 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236259216] [2020-11-09 15:29:06,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:06,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:06,964 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236259216] [2020-11-09 15:29:06,964 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:06,965 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:29:06,965 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513570709] [2020-11-09 15:29:06,965 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:06,970 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:06,983 INFO L252 McrAutomatonBuilder]: Finished intersection with 23 states and 29 transitions. [2020-11-09 15:29:06,983 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:07,027 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:07,028 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,029 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,030 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,032 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,033 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,034 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:07,034 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,035 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,036 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,140 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:07,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,141 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,142 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,143 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,144 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,144 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,144 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,146 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:07,146 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,147 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,190 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:07,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,191 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,192 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,193 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,194 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:07,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,198 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,199 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,203 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:07,203 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:07,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,204 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:07,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,526 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:07,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:07,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,566 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:07,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,567 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,567 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,568 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:07,568 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:07,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,573 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:07,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,574 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:07,574 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,591 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:07,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:07,753 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:29:07,753 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:29:07,753 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:07,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:29:07,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:29:07,754 INFO L87 Difference]: Start difference. First operand 200 states and 443 transitions. Second operand 6 states. [2020-11-09 15:29:08,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:08,143 INFO L93 Difference]: Finished difference Result 219 states and 473 transitions. [2020-11-09 15:29:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:29:08,145 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-09 15:29:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:08,147 INFO L225 Difference]: With dead ends: 219 [2020-11-09 15:29:08,147 INFO L226 Difference]: Without dead ends: 208 [2020-11-09 15:29:08,147 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:29:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-11-09 15:29:08,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 177. [2020-11-09 15:29:08,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2020-11-09 15:29:08,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 390 transitions. [2020-11-09 15:29:08,154 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 390 transitions. Word has length 15 [2020-11-09 15:29:08,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:08,154 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 390 transitions. [2020-11-09 15:29:08,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:29:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 390 transitions. [2020-11-09 15:29:08,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:29:08,155 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:08,155 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:08,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 15:29:08,156 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:08,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:08,156 INFO L82 PathProgramCache]: Analyzing trace with hash 498246344, now seen corresponding path program 1 times [2020-11-09 15:29:08,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:08,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581763660] [2020-11-09 15:29:08,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:08,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:08,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:08,530 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581763660] [2020-11-09 15:29:08,530 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:08,530 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-09 15:29:08,530 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [774195574] [2020-11-09 15:29:08,530 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:08,535 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:08,545 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 36 transitions. [2020-11-09 15:29:08,545 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:08,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:29:08,556 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,556 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:29:08,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,557 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:29:08,557 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:08,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:08,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,559 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:08,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,559 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:08,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,578 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:08,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:08,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,788 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 20 [2020-11-09 15:29:08,812 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:08,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,813 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,815 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,815 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,815 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,816 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:08,816 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,817 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,818 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:08,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,828 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:29:08,828 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:29:08,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,829 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:29:08,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,830 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:08,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,830 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:08,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,830 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:08,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,831 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:08,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:29:08,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,873 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:29:08,873 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,874 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:08,874 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:08,875 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:29:08,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:08,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:29:08,877 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,238 WARN L194 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 19 [2020-11-09 15:29:09,255 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:29:09,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,256 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:29:09,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,257 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:09,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,259 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:29:09,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:09,260 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:29:09,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:29:09,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 1] term [2020-11-09 15:29:09,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:29:09,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:09,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:09,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:09,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 2, 1] term [2020-11-09 15:29:09,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:09,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:09,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:09,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:09,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:09,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,585 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:09,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,586 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:09,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:09,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,588 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:09,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,723 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 3, 2, 1] term [2020-11-09 15:29:09,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,724 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:29:09,724 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,725 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:09,725 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,726 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 3, 5, 2, 1] term [2020-11-09 15:29:09,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:09,726 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:29:09,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:09,919 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [9644#(and (= ~x~0 1) (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0)) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (or (= (mod ~x$w_buff0_used~0 256) 0) (= (mod ~x$w_buff1_used~0 256) 0))), 9645#(and (= ~x~0 1) (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0)) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (= (mod ~x$w_buff1_used~0 256) 0)), 9646#(and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0)) (= 0 ~x$r_buff0_thd0~0) (= 0 ~x$r_buff0_thd2~0) (= (mod ~x$w_buff1_used~0 256) 0))] [2020-11-09 15:29:09,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-09 15:29:09,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:09,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-09 15:29:09,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-11-09 15:29:09,921 INFO L87 Difference]: Start difference. First operand 177 states and 390 transitions. Second operand 13 states. [2020-11-09 15:29:10,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:10,494 INFO L93 Difference]: Finished difference Result 316 states and 684 transitions. [2020-11-09 15:29:10,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 15:29:10,494 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2020-11-09 15:29:10,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:10,496 INFO L225 Difference]: With dead ends: 316 [2020-11-09 15:29:10,497 INFO L226 Difference]: Without dead ends: 176 [2020-11-09 15:29:10,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2020-11-09 15:29:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2020-11-09 15:29:10,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 170. [2020-11-09 15:29:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2020-11-09 15:29:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 376 transitions. [2020-11-09 15:29:10,504 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 376 transitions. Word has length 16 [2020-11-09 15:29:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:10,504 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 376 transitions. [2020-11-09 15:29:10,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-09 15:29:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 376 transitions. [2020-11-09 15:29:10,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:29:10,505 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:10,505 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:10,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 15:29:10,506 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1053572840, now seen corresponding path program 2 times [2020-11-09 15:29:10,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:10,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604857535] [2020-11-09 15:29:10,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:10,794 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604857535] [2020-11-09 15:29:10,795 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:10,795 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:29:10,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [611531916] [2020-11-09 15:29:10,795 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:10,801 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:10,813 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 30 transitions. [2020-11-09 15:29:10,813 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:10,847 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:10,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,848 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,849 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,850 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,850 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,850 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,851 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:10,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,852 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,853 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,967 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:10,967 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,969 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,969 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,970 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,970 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,971 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:10,972 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,972 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,973 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:10,973 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,979 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:29:10,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,980 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:10,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,981 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:10,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,982 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 4, 3, 4, 2, 2, 1] term [2020-11-09 15:29:10,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,983 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 4, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:29:10,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:10,983 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 4, 4, 3, 4, 2, 2, 1] term [2020-11-09 15:29:10,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,009 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:11,010 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,010 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,011 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,012 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,013 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,014 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:11,014 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,015 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,016 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,515 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:11,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,547 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:11,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,558 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 2, 2, 4, 3, 3, 2, 1] term [2020-11-09 15:29:11,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,559 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:11,559 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:29:11,560 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,560 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 4, 3, 4, 2, 2, 1] term [2020-11-09 15:29:11,561 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,561 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 4, 5, 3, 5, 3, 3, 2, 1] term [2020-11-09 15:29:11,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,562 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 2, 4, 4, 4, 3, 4, 2, 2, 1] term [2020-11-09 15:29:11,562 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:11,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,585 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,586 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,586 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,586 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,588 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:11,588 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,589 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,590 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:11,590 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:11,670 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:29:11,670 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:29:11,670 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:29:11,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:29:11,671 INFO L87 Difference]: Start difference. First operand 170 states and 376 transitions. Second operand 7 states. [2020-11-09 15:29:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:12,082 INFO L93 Difference]: Finished difference Result 192 states and 417 transitions. [2020-11-09 15:29:12,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:29:12,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-11-09 15:29:12,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:12,086 INFO L225 Difference]: With dead ends: 192 [2020-11-09 15:29:12,086 INFO L226 Difference]: Without dead ends: 157 [2020-11-09 15:29:12,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:29:12,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2020-11-09 15:29:12,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 139. [2020-11-09 15:29:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2020-11-09 15:29:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 300 transitions. [2020-11-09 15:29:12,092 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 300 transitions. Word has length 16 [2020-11-09 15:29:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:12,092 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 300 transitions. [2020-11-09 15:29:12,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:29:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 300 transitions. [2020-11-09 15:29:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:29:12,093 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:12,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:12,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-09 15:29:12,094 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:12,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:12,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1441765320, now seen corresponding path program 3 times [2020-11-09 15:29:12,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:12,101 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393326144] [2020-11-09 15:29:12,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:12,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:12,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393326144] [2020-11-09 15:29:12,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:12,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:29:12,340 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [495579348] [2020-11-09 15:29:12,340 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:12,346 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:12,359 INFO L252 McrAutomatonBuilder]: Finished intersection with 22 states and 26 transitions. [2020-11-09 15:29:12,359 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:12,382 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:12,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,384 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,385 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,386 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,386 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,387 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:12,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,388 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,389 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,471 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:12,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,472 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,472 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,473 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,474 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,475 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,475 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,476 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:12,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,477 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,478 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:12,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,492 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:12,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,493 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:12,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,494 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:29:12,494 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,496 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:29:12,496 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,497 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:12,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,634 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:12,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,650 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:12,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:12,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,652 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:29:12,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,654 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 4, 2, 3, 2, 1] term [2020-11-09 15:29:12,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:12,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,658 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:12,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:12,767 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [10802#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd1~0) (= 0 ~x$r_buff0_thd2~0))] [2020-11-09 15:29:12,767 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 15:29:12,767 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:12,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 15:29:12,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:29:12,768 INFO L87 Difference]: Start difference. First operand 139 states and 300 transitions. Second operand 9 states. [2020-11-09 15:29:13,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:13,214 INFO L93 Difference]: Finished difference Result 219 states and 460 transitions. [2020-11-09 15:29:13,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:29:13,217 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-11-09 15:29:13,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:13,218 INFO L225 Difference]: With dead ends: 219 [2020-11-09 15:29:13,218 INFO L226 Difference]: Without dead ends: 155 [2020-11-09 15:29:13,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:29:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-11-09 15:29:13,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2020-11-09 15:29:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-11-09 15:29:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 323 transitions. [2020-11-09 15:29:13,224 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 323 transitions. Word has length 16 [2020-11-09 15:29:13,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:13,224 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 323 transitions. [2020-11-09 15:29:13,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 15:29:13,225 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 323 transitions. [2020-11-09 15:29:13,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:29:13,225 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:13,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:13,225 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-09 15:29:13,226 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:13,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:13,226 INFO L82 PathProgramCache]: Analyzing trace with hash -301456678, now seen corresponding path program 4 times [2020-11-09 15:29:13,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:13,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984952493] [2020-11-09 15:29:13,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:13,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984952493] [2020-11-09 15:29:13,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:13,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:29:13,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1976101991] [2020-11-09 15:29:13,426 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:13,432 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:13,441 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 18 transitions. [2020-11-09 15:29:13,441 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:13,444 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:29:13,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-09 15:29:13,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-09 15:29:13,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-09 15:29:13,446 INFO L87 Difference]: Start difference. First operand 150 states and 323 transitions. Second operand 6 states. [2020-11-09 15:29:13,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:13,614 INFO L93 Difference]: Finished difference Result 169 states and 354 transitions. [2020-11-09 15:29:13,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:29:13,616 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-09 15:29:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:13,617 INFO L225 Difference]: With dead ends: 169 [2020-11-09 15:29:13,617 INFO L226 Difference]: Without dead ends: 148 [2020-11-09 15:29:13,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:29:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-11-09 15:29:13,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2020-11-09 15:29:13,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2020-11-09 15:29:13,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 314 transitions. [2020-11-09 15:29:13,622 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 314 transitions. Word has length 16 [2020-11-09 15:29:13,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:13,623 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 314 transitions. [2020-11-09 15:29:13,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-09 15:29:13,623 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 314 transitions. [2020-11-09 15:29:13,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:29:13,623 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:13,624 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:13,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-09 15:29:13,624 INFO L429 AbstractCegarLoop]: === Iteration 18 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:13,624 INFO L82 PathProgramCache]: Analyzing trace with hash -329079994, now seen corresponding path program 5 times [2020-11-09 15:29:13,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:13,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117587400] [2020-11-09 15:29:13,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:13,851 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 23 [2020-11-09 15:29:14,004 WARN L194 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2020-11-09 15:29:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:14,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117587400] [2020-11-09 15:29:14,233 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:14,233 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 15:29:14,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [264428191] [2020-11-09 15:29:14,234 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:14,239 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:14,254 INFO L252 McrAutomatonBuilder]: Finished intersection with 29 states and 43 transitions. [2020-11-09 15:29:14,255 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:14,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:14,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,283 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,283 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,284 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,284 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,284 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,285 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:14,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,287 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,287 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,288 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,439 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:14,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,578 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:14,578 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,581 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,582 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:14,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,584 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,585 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,782 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:14,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,832 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:14,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,835 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,836 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,836 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,837 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:14,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:14,838 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:14,999 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:14,999 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:15,006 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [11802#(and (or (= 0 ~x$r_buff0_thd1~0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= 0 ~x$w_buff0~0) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= ~x~0 1) (not (= (mod ~x$w_buff0_used~0 256) 0))) (or (= 0 ~x$r_buff0_thd0~0) (not (= (mod ~x$w_buff0_used~0 256) 0))))] [2020-11-09 15:29:15,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-09 15:29:15,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-09 15:29:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-09 15:29:15,007 INFO L87 Difference]: Start difference. First operand 145 states and 314 transitions. Second operand 10 states. [2020-11-09 15:29:15,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:15,584 INFO L93 Difference]: Finished difference Result 162 states and 339 transitions. [2020-11-09 15:29:15,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-09 15:29:15,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-11-09 15:29:15,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:15,587 INFO L225 Difference]: With dead ends: 162 [2020-11-09 15:29:15,587 INFO L226 Difference]: Without dead ends: 146 [2020-11-09 15:29:15,587 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-11-09 15:29:15,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2020-11-09 15:29:15,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2020-11-09 15:29:15,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-09 15:29:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 255 transitions. [2020-11-09 15:29:15,592 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 255 transitions. Word has length 16 [2020-11-09 15:29:15,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:15,593 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 255 transitions. [2020-11-09 15:29:15,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-09 15:29:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 255 transitions. [2020-11-09 15:29:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-09 15:29:15,594 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:29:15,594 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:29:15,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-09 15:29:15,594 INFO L429 AbstractCegarLoop]: === Iteration 19 === [P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:29:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:29:15,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1139453172, now seen corresponding path program 1 times [2020-11-09 15:29:15,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:29:15,597 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048497466] [2020-11-09 15:29:15,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:29:15,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:29:15,983 WARN L194 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 32 [2020-11-09 15:29:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-09 15:29:16,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048497466] [2020-11-09 15:29:16,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:29:16,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:29:16,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [42190885] [2020-11-09 15:29:16,211 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:29:16,218 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:29:16,238 INFO L252 McrAutomatonBuilder]: Finished intersection with 28 states and 37 transitions. [2020-11-09 15:29:16,238 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:29:16,276 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:16,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,276 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,277 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,278 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,278 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,279 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,280 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:16,281 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,281 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,282 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,282 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,444 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:16,444 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,462 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,462 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,463 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:16,464 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,508 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,509 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:16,510 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,575 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,576 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:16,577 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 4, 4, 3, 3, 2, 1] term [2020-11-09 15:29:16,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,642 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,642 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,643 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,644 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,644 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,645 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,646 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-09 15:29:16,646 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,647 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 4, 3, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,647 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,647 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1] term [2020-11-09 15:29:16,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,663 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:16,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,664 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,664 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,665 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 7, 3, 2, 2, 1] term [2020-11-09 15:29:16,665 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:16,954 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-11-09 15:29:16,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,964 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:29:16,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,965 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:29:16,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:29:16,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 7, 3, 2, 2, 1] term [2020-11-09 15:29:16,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:29:17,084 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:29:17,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:29:17,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:29:17,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:29:17,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:29:17,085 INFO L87 Difference]: Start difference. First operand 119 states and 255 transitions. Second operand 8 states. [2020-11-09 15:29:17,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:29:17,302 INFO L93 Difference]: Finished difference Result 115 states and 247 transitions. [2020-11-09 15:29:17,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-09 15:29:17,302 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-11-09 15:29:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:29:17,302 INFO L225 Difference]: With dead ends: 115 [2020-11-09 15:29:17,303 INFO L226 Difference]: Without dead ends: 0 [2020-11-09 15:29:17,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 7 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:29:17,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-09 15:29:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-09 15:29:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-09 15:29:17,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-09 15:29:17,304 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2020-11-09 15:29:17,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:29:17,305 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-09 15:29:17,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:29:17,305 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-09 15:29:17,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-09 15:29:17,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-09 15:29:17,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:29:17 BasicIcfg [2020-11-09 15:29:17,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:29:17,310 INFO L168 Benchmark]: Toolchain (without parser) took 64556.33 ms. Allocated memory was 161.5 MB in the beginning and 723.5 MB in the end (delta: 562.0 MB). Free memory was 135.4 MB in the beginning and 514.4 MB in the end (delta: -379.0 MB). Peak memory consumption was 183.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:29:17,310 INFO L168 Benchmark]: CDTParser took 0.36 ms. Allocated memory is still 161.5 MB. Free memory is still 134.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:29:17,311 INFO L168 Benchmark]: CACSL2BoogieTranslator took 944.31 ms. Allocated memory is still 161.5 MB. Free memory was 134.8 MB in the beginning and 126.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:29:17,311 INFO L168 Benchmark]: Boogie Procedure Inliner took 101.92 ms. Allocated memory is still 161.5 MB. Free memory was 126.1 MB in the beginning and 121.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:29:17,312 INFO L168 Benchmark]: Boogie Preprocessor took 69.63 ms. Allocated memory is still 161.5 MB. Free memory was 121.9 MB in the beginning and 118.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:29:17,312 INFO L168 Benchmark]: RCFGBuilder took 6099.61 ms. Allocated memory was 161.5 MB in the beginning and 211.8 MB in the end (delta: 50.3 MB). Free memory was 118.3 MB in the beginning and 69.0 MB in the end (delta: 49.3 MB). Peak memory consumption was 108.0 MB. Max. memory is 8.0 GB. [2020-11-09 15:29:17,313 INFO L168 Benchmark]: TraceAbstraction took 57319.29 ms. Allocated memory was 211.8 MB in the beginning and 723.5 MB in the end (delta: 511.7 MB). Free memory was 68.4 MB in the beginning and 514.4 MB in the end (delta: -446.0 MB). Peak memory consumption was 65.2 MB. Max. memory is 8.0 GB. [2020-11-09 15:29:17,315 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.36 ms. Allocated memory is still 161.5 MB. Free memory is still 134.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 944.31 ms. Allocated memory is still 161.5 MB. Free memory was 134.8 MB in the beginning and 126.1 MB in the end (delta: 8.6 MB). Peak memory consumption was 28.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 101.92 ms. Allocated memory is still 161.5 MB. Free memory was 126.1 MB in the beginning and 121.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 69.63 ms. Allocated memory is still 161.5 MB. Free memory was 121.9 MB in the beginning and 118.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 6099.61 ms. Allocated memory was 161.5 MB in the beginning and 211.8 MB in the end (delta: 50.3 MB). Free memory was 118.3 MB in the beginning and 69.0 MB in the end (delta: 49.3 MB). Peak memory consumption was 108.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 57319.29 ms. Allocated memory was 211.8 MB in the beginning and 723.5 MB in the end (delta: 511.7 MB). Free memory was 68.4 MB in the beginning and 514.4 MB in the end (delta: -446.0 MB). Peak memory consumption was 65.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 661 VarBasedMoverChecksPositive, 30 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 66 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 25.9s, 108 PlacesBefore, 32 PlacesAfterwards, 104 TransitionsBefore, 26 TransitionsAfterwards, 1342 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 93 TotalNumberOfCompositions, 4939 MoverChecksTotal - PositiveResult [Line: 18]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 18]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 18]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 102 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 56.9s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 25.9s, HoareTripleCheckerStatistics: 392 SDtfs, 429 SDslu, 1165 SDs, 0 SdLazy, 1371 SolverSat, 328 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 265 GetRequests, 79 SyntacticMatches, 34 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred 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.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 158 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 41714 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 correct! Received shutdown request...