/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/mix029_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7a177ad [2020-11-09 15:16:07,836 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-09 15:16:07,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-09 15:16:07,885 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-09 15:16:07,886 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-09 15:16:07,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-09 15:16:07,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-09 15:16:07,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-09 15:16:07,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-09 15:16:07,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-09 15:16:07,901 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-09 15:16:07,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-09 15:16:07,904 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-09 15:16:07,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-09 15:16:07,908 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-09 15:16:07,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-09 15:16:07,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-09 15:16:07,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-09 15:16:07,932 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-09 15:16:07,935 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-09 15:16:07,943 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-09 15:16:07,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-09 15:16:07,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-09 15:16:07,949 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-09 15:16:07,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-09 15:16:07,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-09 15:16:07,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-09 15:16:07,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-09 15:16:07,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-09 15:16:07,959 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-09 15:16:07,959 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-09 15:16:07,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-09 15:16:07,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-09 15:16:07,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-09 15:16:07,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-09 15:16:07,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-09 15:16:07,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-09 15:16:07,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-09 15:16:07,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-09 15:16:07,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-09 15:16:07,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-09 15:16:07,972 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:16:08,007 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-09 15:16:08,007 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-09 15:16:08,010 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-09 15:16:08,011 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-09 15:16:08,011 INFO L138 SettingsManager]: * Use SBE=true [2020-11-09 15:16:08,011 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-09 15:16:08,011 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-09 15:16:08,012 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-09 15:16:08,012 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-09 15:16:08,012 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-09 15:16:08,012 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-09 15:16:08,012 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-09 15:16:08,013 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-09 15:16:08,013 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-09 15:16:08,013 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-09 15:16:08,013 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-09 15:16:08,014 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-09 15:16:08,014 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-09 15:16:08,014 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-09 15:16:08,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-09 15:16:08,015 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-09 15:16:08,015 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-09 15:16:08,015 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-09 15:16:08,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-11-09 15:16:08,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-09 15:16:08,016 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-09 15:16:08,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-09 15:16:08,016 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-11-09 15:16:08,017 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-11-09 15:16:08,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-09 15:16:08,017 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:16:08,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-09 15:16:08,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-09 15:16:08,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-09 15:16:08,584 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-09 15:16:08,586 INFO L275 PluginConnector]: CDTParser initialized [2020-11-09 15:16:08,587 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_pso.opt.i [2020-11-09 15:16:08,730 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30792c12/4c665d5af6ff4815879bac25fc804840/FLAGaab24b366 [2020-11-09 15:16:09,670 INFO L306 CDTParser]: Found 1 translation units. [2020-11-09 15:16:09,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_pso.opt.i [2020-11-09 15:16:09,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30792c12/4c665d5af6ff4815879bac25fc804840/FLAGaab24b366 [2020-11-09 15:16:09,850 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e30792c12/4c665d5af6ff4815879bac25fc804840 [2020-11-09 15:16:09,857 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-09 15:16:09,868 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-09 15:16:09,873 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-09 15:16:09,873 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-09 15:16:09,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-09 15:16:09,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:16:09" (1/1) ... [2020-11-09 15:16:09,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e9206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:09, skipping insertion in model container [2020-11-09 15:16:09,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:16:09" (1/1) ... [2020-11-09 15:16:09,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-09 15:16:10,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-09 15:16:10,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:16:10,999 INFO L203 MainTranslator]: Completed pre-run [2020-11-09 15:16:11,135 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-09 15:16:11,373 INFO L208 MainTranslator]: Completed translation [2020-11-09 15:16:11,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11 WrapperNode [2020-11-09 15:16:11,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-09 15:16:11,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-09 15:16:11,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-09 15:16:11,376 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-09 15:16:11,388 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:16:11" (1/1) ... [2020-11-09 15:16:11,415 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:16:11" (1/1) ... [2020-11-09 15:16:11,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-09 15:16:11,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-09 15:16:11,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-09 15:16:11,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-09 15:16:11,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (1/1) ... [2020-11-09 15:16:11,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (1/1) ... [2020-11-09 15:16:11,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (1/1) ... [2020-11-09 15:16:11,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (1/1) ... [2020-11-09 15:16:11,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (1/1) ... [2020-11-09 15:16:11,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (1/1) ... [2020-11-09 15:16:11,572 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (1/1) ... [2020-11-09 15:16:11,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-09 15:16:11,585 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-09 15:16:11,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-09 15:16:11,586 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-09 15:16:11,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (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:16:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-09 15:16:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-09 15:16:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-09 15:16:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-09 15:16:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-09 15:16:11,703 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-09 15:16:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-09 15:16:11,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-09 15:16:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-09 15:16:11,706 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-09 15:16:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-09 15:16:11,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-09 15:16:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-09 15:16:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-09 15:16:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-09 15:16:11,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-09 15:16:11,712 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:16:15,135 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-09 15:16:15,135 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-09 15:16:15,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:16:15 BoogieIcfgContainer [2020-11-09 15:16:15,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-09 15:16:15,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-09 15:16:15,142 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-09 15:16:15,147 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-09 15:16:15,147 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 03:16:09" (1/3) ... [2020-11-09 15:16:15,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd5e177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:16:15, skipping insertion in model container [2020-11-09 15:16:15,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:16:11" (2/3) ... [2020-11-09 15:16:15,150 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bd5e177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 03:16:15, skipping insertion in model container [2020-11-09 15:16:15,150 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:16:15" (3/3) ... [2020-11-09 15:16:15,153 INFO L111 eAbstractionObserver]: Analyzing ICFG mix029_pso.opt.i [2020-11-09 15:16:15,178 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-09 15:16:15,179 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-09 15:16:15,185 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-09 15:16:15,186 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-09 15:16:15,245 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,246 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,246 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,247 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,247 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,248 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,248 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,248 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,249 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,249 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,250 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,250 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,250 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,251 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,251 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,251 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,252 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,253 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,254 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,255 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,256 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,257 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,258 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,258 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,258 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,259 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,259 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,260 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,260 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,261 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,261 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,262 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,263 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,263 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,264 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,264 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,265 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,271 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,272 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,272 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,272 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,273 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,273 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,273 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,274 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,276 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,277 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,278 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,279 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,282 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,284 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,287 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,288 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,289 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,292 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,293 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,293 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,294 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,294 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,295 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,299 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,300 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,300 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,301 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-09 15:16:15,303 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-09 15:16:15,322 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-09 15:16:15,359 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-09 15:16:15,359 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-09 15:16:15,360 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-09 15:16:15,360 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-11-09 15:16:15,360 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-09 15:16:15,360 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-09 15:16:15,360 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-09 15:16:15,361 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-09 15:16:15,382 INFO L128 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-11-09 15:16:15,383 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-09 15:16:15,389 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 120 transitions, 260 flow [2020-11-09 15:16:15,392 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 120 transitions, 260 flow [2020-11-09 15:16:15,471 INFO L129 PetriNetUnfolder]: 3/116 cut-off events. [2020-11-09 15:16:15,472 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-09 15:16:15,478 INFO L84 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 116 events. 3/116 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2020-11-09 15:16:15,485 INFO L116 LiptonReduction]: Number of co-enabled transitions 2862 [2020-11-09 15:16:16,110 WARN L194 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2020-11-09 15:16:16,270 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 63 [2020-11-09 15:16:16,467 WARN L194 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-11-09 15:16:16,714 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 28 [2020-11-09 15:16:18,755 WARN L194 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-11-09 15:16:18,897 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-09 15:16:19,614 WARN L194 SmtUtils]: Spent 715.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2020-11-09 15:16:19,631 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-11-09 15:16:19,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:20,193 WARN L194 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 87 [2020-11-09 15:16:21,574 WARN L194 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-11-09 15:16:21,736 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2020-11-09 15:16:23,227 WARN L194 SmtUtils]: Spent 1.44 s on a formula simplification. DAG size of input: 232 DAG size of output: 192 [2020-11-09 15:16:23,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 2, 1] term [2020-11-09 15:16:23,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:23,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 15:16:23,250 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:25,261 WARN L194 SmtUtils]: Spent 1.97 s on a formula simplification. DAG size of input: 150 DAG size of output: 130 [2020-11-09 15:16:28,331 WARN L194 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 316 DAG size of output: 272 [2020-11-09 15:16:28,339 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:28,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,349 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:28,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-09 15:16:28,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:16:28,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:28,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,379 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:28,381 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,388 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:28,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:28,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:28,395 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:16:28,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,402 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:16:28,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:16:28,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,413 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:16:28,413 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:16:28,427 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:28,429 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:16:28,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:28,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,440 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:28,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:28,443 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:16:28,443 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:28,447 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:28,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:28,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:28,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:16:28,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:34,002 WARN L194 SmtUtils]: Spent 5.52 s on a formula simplification. DAG size of input: 366 DAG size of output: 269 [2020-11-09 15:16:36,236 WARN L194 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 143 DAG size of output: 134 [2020-11-09 15:16:36,998 WARN L194 SmtUtils]: Spent 758.00 ms on a formula simplification that was a NOOP. DAG size: 131 [2020-11-09 15:16:42,933 WARN L194 SmtUtils]: Spent 5.93 s on a formula simplification. DAG size of input: 269 DAG size of output: 258 [2020-11-09 15:16:45,126 WARN L194 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 254 [2020-11-09 15:16:48,001 WARN L194 SmtUtils]: Spent 2.85 s on a formula simplification. DAG size of input: 233 DAG size of output: 192 [2020-11-09 15:16:48,028 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 2, 1] term [2020-11-09 15:16:48,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:48,030 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 6, 5, 1] term [2020-11-09 15:16:48,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:49,916 WARN L194 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 150 DAG size of output: 110 [2020-11-09 15:16:54,015 WARN L194 SmtUtils]: Spent 4.09 s on a formula simplification. DAG size of input: 317 DAG size of output: 273 [2020-11-09 15:16:54,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:54,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,034 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:54,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:54,035 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:16:54,036 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,039 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:54,040 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,044 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:54,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-09 15:16:54,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:54,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,066 INFO L603 QuantifierPusher]: Distributing 5 conjuncts over 2 disjuncts [2020-11-09 15:16:54,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:54,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,090 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:54,090 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:54,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:16:54,091 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,097 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:16:54,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 1] term [2020-11-09 15:16:54,102 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 1] term [2020-11-09 15:16:54,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:54,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:16:54,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:54,113 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 7, 3, 2, 2, 1] term [2020-11-09 15:16:54,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-09 15:16:54,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2020-11-09 15:16:54,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:16:54,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 1] term [2020-11-09 15:16:54,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-09 15:17:00,336 WARN L194 SmtUtils]: Spent 6.20 s on a formula simplification. DAG size of input: 372 DAG size of output: 250 [2020-11-09 15:17:00,469 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-09 15:17:00,592 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-09 15:17:00,750 WARN L194 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-09 15:17:00,895 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2020-11-09 15:17:02,054 WARN L194 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-09 15:17:02,693 WARN L194 SmtUtils]: Spent 635.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-11-09 15:17:06,389 WARN L194 SmtUtils]: Spent 3.69 s on a formula simplification. DAG size of input: 233 DAG size of output: 232 [2020-11-09 15:17:08,281 WARN L194 SmtUtils]: Spent 1.88 s on a formula simplification that was a NOOP. DAG size: 232 [2020-11-09 15:17:09,749 WARN L194 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 137 [2020-11-09 15:17:11,370 WARN L194 SmtUtils]: Spent 1.62 s on a formula simplification that was a NOOP. DAG size: 135 [2020-11-09 15:17:15,498 WARN L194 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 260 DAG size of output: 259 [2020-11-09 15:17:17,752 WARN L194 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 257 [2020-11-09 15:17:17,925 WARN L194 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-11-09 15:17:18,100 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-11-09 15:17:18,284 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-11-09 15:17:18,451 WARN L194 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-11-09 15:17:18,614 WARN L194 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 15:17:18,781 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 15:17:18,944 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 15:17:19,108 WARN L194 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2020-11-09 15:17:20,192 WARN L194 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-09 15:17:20,639 WARN L194 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-09 15:17:21,672 WARN L194 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-09 15:17:22,163 WARN L194 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-09 15:17:22,200 INFO L131 LiptonReduction]: Checked pairs total: 8003 [2020-11-09 15:17:22,201 INFO L133 LiptonReduction]: Total number of compositions: 105 [2020-11-09 15:17:22,209 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-11-09 15:17:22,580 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3890 states. [2020-11-09 15:17:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3890 states. [2020-11-09 15:17:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-09 15:17:22,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:22,595 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:22,597 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:22,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:22,618 INFO L82 PathProgramCache]: Analyzing trace with hash -862025444, now seen corresponding path program 1 times [2020-11-09 15:17:22,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:22,657 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556163765] [2020-11-09 15:17:22,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:23,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:23,177 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:17:23,179 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556163765] [2020-11-09 15:17:23,180 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:23,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:17:23,182 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1948391912] [2020-11-09 15:17:23,183 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:23,188 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:23,209 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-11-09 15:17:23,209 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:23,218 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:17:23,219 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:17:23,219 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:23,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:17:23,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:17:23,242 INFO L87 Difference]: Start difference. First operand 3890 states. Second operand 3 states. [2020-11-09 15:17:23,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:23,573 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-11-09 15:17:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:17:23,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-09 15:17:23,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:23,671 INFO L225 Difference]: With dead ends: 3250 [2020-11-09 15:17:23,671 INFO L226 Difference]: Without dead ends: 2650 [2020-11-09 15:17:23,674 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:17:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-11-09 15:17:23,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-11-09 15:17:23,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-11-09 15:17:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-11-09 15:17:23,990 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 7 [2020-11-09 15:17:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:23,991 INFO L481 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-11-09 15:17:23,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:17:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-11-09 15:17:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-09 15:17:23,999 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:23,999 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:24,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-09 15:17:24,000 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:24,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash -556615316, now seen corresponding path program 1 times [2020-11-09 15:17:24,011 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:24,012 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913352106] [2020-11-09 15:17:24,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:24,262 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:17:24,263 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913352106] [2020-11-09 15:17:24,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:24,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:17:24,264 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [906189763] [2020-11-09 15:17:24,264 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:24,266 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:24,270 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-11-09 15:17:24,270 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:24,271 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:17:24,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:17:24,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:24,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:17:24,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:17:24,275 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-11-09 15:17:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:24,456 INFO L93 Difference]: Finished difference Result 2610 states and 10046 transitions. [2020-11-09 15:17:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:17:24,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-09 15:17:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:24,493 INFO L225 Difference]: With dead ends: 2610 [2020-11-09 15:17:24,493 INFO L226 Difference]: Without dead ends: 2610 [2020-11-09 15:17:24,494 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:17:24,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2610 states. [2020-11-09 15:17:24,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2610 to 2610. [2020-11-09 15:17:24,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2610 states. [2020-11-09 15:17:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2610 states to 2610 states and 10046 transitions. [2020-11-09 15:17:24,659 INFO L78 Accepts]: Start accepts. Automaton has 2610 states and 10046 transitions. Word has length 11 [2020-11-09 15:17:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:24,659 INFO L481 AbstractCegarLoop]: Abstraction has 2610 states and 10046 transitions. [2020-11-09 15:17:24,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:17:24,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2610 states and 10046 transitions. [2020-11-09 15:17:24,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-09 15:17:24,669 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:24,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:24,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-09 15:17:24,670 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:24,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:24,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1701594841, now seen corresponding path program 1 times [2020-11-09 15:17:24,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:24,687 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412938221] [2020-11-09 15:17:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:24,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:24,769 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:17:24,770 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412938221] [2020-11-09 15:17:24,770 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:24,770 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-09 15:17:24,770 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [524276844] [2020-11-09 15:17:24,770 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:24,772 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:24,779 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 18 transitions. [2020-11-09 15:17:24,780 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:24,878 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:17:24,878 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-09 15:17:24,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:24,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-09 15:17:24,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-09 15:17:24,881 INFO L87 Difference]: Start difference. First operand 2610 states and 10046 transitions. Second operand 3 states. [2020-11-09 15:17:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:24,929 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-11-09 15:17:24,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-09 15:17:24,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2020-11-09 15:17:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:24,967 INFO L225 Difference]: With dead ends: 2450 [2020-11-09 15:17:24,967 INFO L226 Difference]: Without dead ends: 2450 [2020-11-09 15:17:24,968 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:17:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-11-09 15:17:25,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-11-09 15:17:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-11-09 15:17:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-11-09 15:17:25,131 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 12 [2020-11-09 15:17:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:25,132 INFO L481 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-11-09 15:17:25,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-09 15:17:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-11-09 15:17:25,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-09 15:17:25,135 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:25,136 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:25,136 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-09 15:17:25,136 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:25,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:25,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1963552941, now seen corresponding path program 1 times [2020-11-09 15:17:25,142 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:25,142 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488692381] [2020-11-09 15:17:25,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:25,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:25,488 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:17:25,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488692381] [2020-11-09 15:17:25,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:25,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-09 15:17:25,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1071449864] [2020-11-09 15:17:25,490 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:25,493 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:25,498 INFO L252 McrAutomatonBuilder]: Finished intersection with 18 states and 21 transitions. [2020-11-09 15:17:25,499 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:25,510 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:17:25,511 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:25,513 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:25,513 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:25,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:17:25,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:25,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:25,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:25,734 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:17:25,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:17:25,735 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:25,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:17:25,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:17:25,736 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 4 states. [2020-11-09 15:17:26,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:26,003 INFO L93 Difference]: Finished difference Result 2418 states and 9214 transitions. [2020-11-09 15:17:26,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:17:26,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-09 15:17:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:26,039 INFO L225 Difference]: With dead ends: 2418 [2020-11-09 15:17:26,040 INFO L226 Difference]: Without dead ends: 2418 [2020-11-09 15:17:26,040 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:17:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2418 states. [2020-11-09 15:17:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2418 to 2418. [2020-11-09 15:17:26,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2020-11-09 15:17:26,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 9214 transitions. [2020-11-09 15:17:26,207 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 9214 transitions. Word has length 13 [2020-11-09 15:17:26,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:26,208 INFO L481 AbstractCegarLoop]: Abstraction has 2418 states and 9214 transitions. [2020-11-09 15:17:26,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:17:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 9214 transitions. [2020-11-09 15:17:26,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-11-09 15:17:26,212 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:26,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:26,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-09 15:17:26,213 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1149857192, now seen corresponding path program 1 times [2020-11-09 15:17:26,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:26,223 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130812449] [2020-11-09 15:17:26,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:26,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:26,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:17:26,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130812449] [2020-11-09 15:17:26,644 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:26,644 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:17:26,644 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1719177889] [2020-11-09 15:17:26,645 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:26,649 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:26,656 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 38 transitions. [2020-11-09 15:17:26,656 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:26,667 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:17:26,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:26,668 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:17:26,669 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:26,670 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:17:26,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:26,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:17:26,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:26,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:17:26,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:26,788 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:17:26,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:27,366 WARN L194 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2020-11-09 15:17:27,440 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [38915#(and (or (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 38916#(and (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (<= ~y$r_buff0_thd0~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))))] [2020-11-09 15:17:27,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:17:27,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:27,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:17:27,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:17:27,443 INFO L87 Difference]: Start difference. First operand 2418 states and 9214 transitions. Second operand 7 states. [2020-11-09 15:17:27,685 WARN L194 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 16 [2020-11-09 15:17:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:28,048 INFO L93 Difference]: Finished difference Result 3058 states and 11694 transitions. [2020-11-09 15:17:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:17:28,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2020-11-09 15:17:28,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:28,113 INFO L225 Difference]: With dead ends: 3058 [2020-11-09 15:17:28,114 INFO L226 Difference]: Without dead ends: 3058 [2020-11-09 15:17:28,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:17:28,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2020-11-09 15:17:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2482. [2020-11-09 15:17:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2020-11-09 15:17:28,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 9438 transitions. [2020-11-09 15:17:28,325 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 9438 transitions. Word has length 14 [2020-11-09 15:17:28,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:28,325 INFO L481 AbstractCegarLoop]: Abstraction has 2482 states and 9438 transitions. [2020-11-09 15:17:28,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:17:28,326 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 9438 transitions. [2020-11-09 15:17:28,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-09 15:17:28,331 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:28,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:28,332 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-09 15:17:28,332 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:28,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:28,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1925737492, now seen corresponding path program 1 times [2020-11-09 15:17:28,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:28,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51322591] [2020-11-09 15:17:28,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:28,703 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 15 [2020-11-09 15:17:28,789 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:17:28,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51322591] [2020-11-09 15:17:28,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:28,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:17:28,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [281809196] [2020-11-09 15:17:28,791 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:28,793 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:28,801 INFO L252 McrAutomatonBuilder]: Finished intersection with 38 states and 63 transitions. [2020-11-09 15:17:28,801 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:28,813 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:17:28,813 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:28,814 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:28,814 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:29,052 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2020-11-09 15:17:29,117 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-11-09 15:17:29,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:29,118 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:29,119 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:29,435 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [46948#(and (<= ~y$w_buff1~0 0) (or (= (mod ~y$r_buff0_thd0~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0)) (= ~y$w_buff0~0 0) (or (= ~y~0 ~y$w_buff1~0) (= ~y~0 1))), 46949#(and (<= ~y$w_buff1~0 0) (or (= (mod ~y$r_buff0_thd0~0 256) 0) (= ~y$w_buff1~0 ~y$w_buff0~0)) (= ~y$w_buff0~0 0))] [2020-11-09 15:17:29,436 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:17:29,436 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:29,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:17:29,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:17:29,437 INFO L87 Difference]: Start difference. First operand 2482 states and 9438 transitions. Second operand 7 states. [2020-11-09 15:17:29,573 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 17 [2020-11-09 15:17:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:29,856 INFO L93 Difference]: Finished difference Result 2522 states and 9580 transitions. [2020-11-09 15:17:29,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:17:29,859 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-11-09 15:17:29,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:29,879 INFO L225 Difference]: With dead ends: 2522 [2020-11-09 15:17:29,879 INFO L226 Difference]: Without dead ends: 2522 [2020-11-09 15:17:29,879 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:17:29,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2020-11-09 15:17:30,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2498. [2020-11-09 15:17:30,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2498 states. [2020-11-09 15:17:30,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2498 states to 2498 states and 9494 transitions. [2020-11-09 15:17:30,030 INFO L78 Accepts]: Start accepts. Automaton has 2498 states and 9494 transitions. Word has length 15 [2020-11-09 15:17:30,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:30,030 INFO L481 AbstractCegarLoop]: Abstraction has 2498 states and 9494 transitions. [2020-11-09 15:17:30,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:17:30,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2498 states and 9494 transitions. [2020-11-09 15:17:30,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:17:30,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:30,038 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:17:30,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-09 15:17:30,038 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:30,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:30,039 INFO L82 PathProgramCache]: Analyzing trace with hash -180435593, now seen corresponding path program 1 times [2020-11-09 15:17:30,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:30,042 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378402731] [2020-11-09 15:17:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:30,526 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:17:30,527 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378402731] [2020-11-09 15:17:30,527 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:30,527 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-09 15:17:30,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [528467804] [2020-11-09 15:17:30,528 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:30,531 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:30,550 INFO L252 McrAutomatonBuilder]: Finished intersection with 62 states and 130 transitions. [2020-11-09 15:17:30,551 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:30,563 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:17:30,563 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:30,564 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:17:30,564 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:30,565 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:17:30,566 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:30,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:17:30,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:30,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-11-09 15:17:30,785 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:30,786 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 4, 3, 2, 3, 2, 1] term [2020-11-09 15:17:30,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:31,346 WARN L194 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2020-11-09 15:17:31,550 WARN L194 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 14 [2020-11-09 15:17:32,275 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 5 new interpolants: [54480#(and (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (<= ~y$r_buff0_thd0~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 54476#(and (or (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0))), 54477#(and (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (= ~y$w_buff1_used~0 0) (<= 0 ~y$r_buff0_thd0~0)), 54478#(and (or (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0))), 54479#(and (or (= ~y~0 1) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (<= ~y$r_buff0_thd0~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))))] [2020-11-09 15:17:32,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 15:17:32,277 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:32,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 15:17:32,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:17:32,278 INFO L87 Difference]: Start difference. First operand 2498 states and 9494 transitions. Second operand 11 states. [2020-11-09 15:17:32,469 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 12 [2020-11-09 15:17:32,678 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 18 [2020-11-09 15:17:32,850 WARN L194 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2020-11-09 15:17:33,060 WARN L194 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 14 [2020-11-09 15:17:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:33,460 INFO L93 Difference]: Finished difference Result 3018 states and 11368 transitions. [2020-11-09 15:17:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:17:33,464 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-11-09 15:17:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:33,488 INFO L225 Difference]: With dead ends: 3018 [2020-11-09 15:17:33,489 INFO L226 Difference]: Without dead ends: 3018 [2020-11-09 15:17:33,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2020-11-09 15:17:33,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2020-11-09 15:17:33,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 2946. [2020-11-09 15:17:33,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2946 states. [2020-11-09 15:17:33,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2946 states to 2946 states and 11126 transitions. [2020-11-09 15:17:33,689 INFO L78 Accepts]: Start accepts. Automaton has 2946 states and 11126 transitions. Word has length 16 [2020-11-09 15:17:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:33,690 INFO L481 AbstractCegarLoop]: Abstraction has 2946 states and 11126 transitions. [2020-11-09 15:17:33,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 15:17:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2946 states and 11126 transitions. [2020-11-09 15:17:33,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-09 15:17:33,700 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:33,700 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:17:33,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-09 15:17:33,701 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:33,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 869336839, now seen corresponding path program 1 times [2020-11-09 15:17:33,705 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:33,706 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229893214] [2020-11-09 15:17:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:33,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:33,914 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:17:33,915 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229893214] [2020-11-09 15:17:33,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:33,916 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:17:33,916 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995781681] [2020-11-09 15:17:33,916 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:33,922 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:33,939 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 68 transitions. [2020-11-09 15:17:33,940 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:34,018 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,019 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,020 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,021 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,022 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:34,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:17:34,139 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:34,140 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,143 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,143 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,147 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:34,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,161 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:17:34,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:34,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,302 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:34,302 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,382 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,383 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,384 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:34,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,442 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:17:34,466 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,467 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,469 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:34,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:17:34,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:17:34,543 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,545 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:34,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:34,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:34,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:34,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:34,686 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:17:34,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-11-09 15:17:34,824 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [63405#(not (= 4 ~__unbuffered_cnt~0))] [2020-11-09 15:17:34,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-09 15:17:34,825 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-09 15:17:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-09 15:17:34,826 INFO L87 Difference]: Start difference. First operand 2946 states and 11126 transitions. Second operand 5 states. [2020-11-09 15:17:35,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:35,087 INFO L93 Difference]: Finished difference Result 2255 states and 7670 transitions. [2020-11-09 15:17:35,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:17:35,090 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-11-09 15:17:35,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:35,098 INFO L225 Difference]: With dead ends: 2255 [2020-11-09 15:17:35,098 INFO L226 Difference]: Without dead ends: 1463 [2020-11-09 15:17:35,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:17:35,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-11-09 15:17:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 1463. [2020-11-09 15:17:35,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1463 states. [2020-11-09 15:17:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1463 states to 1463 states and 4516 transitions. [2020-11-09 15:17:35,171 INFO L78 Accepts]: Start accepts. Automaton has 1463 states and 4516 transitions. Word has length 16 [2020-11-09 15:17:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:35,172 INFO L481 AbstractCegarLoop]: Abstraction has 1463 states and 4516 transitions. [2020-11-09 15:17:35,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-09 15:17:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1463 states and 4516 transitions. [2020-11-09 15:17:35,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-09 15:17:35,202 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:35,203 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:35,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-09 15:17:35,203 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:35,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2018525097, now seen corresponding path program 1 times [2020-11-09 15:17:35,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:35,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068449238] [2020-11-09 15:17:35,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:35,435 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:17:35,436 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068449238] [2020-11-09 15:17:35,436 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:35,436 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:17:35,437 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [560040773] [2020-11-09 15:17:35,437 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:35,443 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:35,467 INFO L252 McrAutomatonBuilder]: Finished intersection with 42 states and 59 transitions. [2020-11-09 15:17:35,467 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:35,515 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:35,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,518 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:35,519 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,520 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:35,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:35,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:35,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,622 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:35,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,686 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:35,687 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,689 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:35,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,691 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:35,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:35,773 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,775 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:35,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:35,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,847 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:35,847 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,848 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:35,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,850 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:35,851 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,920 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:35,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,921 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:35,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:35,923 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:35,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,052 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [68597#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:17:36,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-09 15:17:36,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:36,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-09 15:17:36,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-09 15:17:36,054 INFO L87 Difference]: Start difference. First operand 1463 states and 4516 transitions. Second operand 7 states. [2020-11-09 15:17:36,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:36,298 INFO L93 Difference]: Finished difference Result 1292 states and 3962 transitions. [2020-11-09 15:17:36,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-09 15:17:36,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-11-09 15:17:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:36,307 INFO L225 Difference]: With dead ends: 1292 [2020-11-09 15:17:36,308 INFO L226 Difference]: Without dead ends: 1144 [2020-11-09 15:17:36,308 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:17:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2020-11-09 15:17:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 952. [2020-11-09 15:17:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2020-11-09 15:17:36,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 2935 transitions. [2020-11-09 15:17:36,357 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 2935 transitions. Word has length 20 [2020-11-09 15:17:36,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:36,358 INFO L481 AbstractCegarLoop]: Abstraction has 952 states and 2935 transitions. [2020-11-09 15:17:36,358 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-09 15:17:36,358 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 2935 transitions. [2020-11-09 15:17:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-09 15:17:36,364 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:36,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:36,364 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-09 15:17:36,364 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:36,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:36,365 INFO L82 PathProgramCache]: Analyzing trace with hash -713815401, now seen corresponding path program 1 times [2020-11-09 15:17:36,369 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:36,369 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626805223] [2020-11-09 15:17:36,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:36,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:36,595 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:17:36,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626805223] [2020-11-09 15:17:36,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:36,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-09 15:17:36,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506491084] [2020-11-09 15:17:36,596 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:36,604 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:36,639 INFO L252 McrAutomatonBuilder]: Finished intersection with 59 states and 90 transitions. [2020-11-09 15:17:36,639 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:36,713 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:36,714 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,716 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:36,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,718 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:36,718 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,784 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:36,784 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,785 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:36,786 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,787 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:36,787 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,858 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:36,859 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,860 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:36,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,862 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:36,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,930 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:36,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,932 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:36,933 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:36,934 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:36,935 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:37,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,007 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,008 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:37,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:37,090 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,094 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:37,095 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,166 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:37,167 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,168 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,168 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,169 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:37,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,245 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:37,246 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,248 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,250 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:37,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,319 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:37,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,321 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,321 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:37,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,392 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:37,393 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,395 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:37,396 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,494 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:37,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,496 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,498 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:37,498 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,605 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,605 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,607 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:37,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,609 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:37,609 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:37,716 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [71803#(<= ~__unbuffered_cnt~0 0)] [2020-11-09 15:17:37,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-09 15:17:37,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:37,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-09 15:17:37,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-11-09 15:17:37,719 INFO L87 Difference]: Start difference. First operand 952 states and 2935 transitions. Second operand 8 states. [2020-11-09 15:17:38,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:38,042 INFO L93 Difference]: Finished difference Result 921 states and 2871 transitions. [2020-11-09 15:17:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:17:38,046 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2020-11-09 15:17:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:38,051 INFO L225 Difference]: With dead ends: 921 [2020-11-09 15:17:38,052 INFO L226 Difference]: Without dead ends: 901 [2020-11-09 15:17:38,053 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:17:38,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2020-11-09 15:17:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 853. [2020-11-09 15:17:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2020-11-09 15:17:38,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2701 transitions. [2020-11-09 15:17:38,104 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2701 transitions. Word has length 23 [2020-11-09 15:17:38,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:38,105 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 2701 transitions. [2020-11-09 15:17:38,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-09 15:17:38,105 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2701 transitions. [2020-11-09 15:17:38,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 15:17:38,110 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:38,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:38,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-09 15:17:38,111 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:38,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:38,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1726558306, now seen corresponding path program 1 times [2020-11-09 15:17:38,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:38,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341540083] [2020-11-09 15:17:38,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:38,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:38,234 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:17:38,235 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341540083] [2020-11-09 15:17:38,237 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:38,237 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-09 15:17:38,237 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1820380972] [2020-11-09 15:17:38,237 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:38,250 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:38,370 INFO L252 McrAutomatonBuilder]: Finished intersection with 131 states and 264 transitions. [2020-11-09 15:17:38,371 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:38,396 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,397 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,398 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,400 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:38,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,471 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:38,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,473 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,475 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:38,475 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,575 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:38,576 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,577 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,577 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,579 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:38,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,653 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:38,653 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,655 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,656 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:38,657 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,727 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:38,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,728 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,728 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,729 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:38,730 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,797 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,801 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:38,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,906 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,908 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:38,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:38,911 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:38,912 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,004 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,005 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,006 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,006 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,079 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,080 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,081 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,081 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,082 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,082 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,150 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,150 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,152 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,153 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,154 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,224 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,225 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,227 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,229 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,304 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,306 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,307 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,308 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,308 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,370 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:39,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,372 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,372 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,374 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,448 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:39,449 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,451 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,451 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,452 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,452 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,507 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:39,508 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,509 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,510 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,512 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,512 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,618 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,619 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,620 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,708 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:39,708 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,709 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,710 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,798 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:39,798 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,799 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,800 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,801 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,894 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:39,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,896 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:39,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,898 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:39,899 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:39,997 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:39,998 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,000 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,000 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,002 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:40,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,102 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:40,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,104 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,105 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:40,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,251 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,251 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,252 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,254 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:40,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,320 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,322 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,323 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:40,323 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,382 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,383 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,385 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,387 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:40,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,464 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,464 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,466 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,466 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,468 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:40,469 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,545 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,546 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:40,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,753 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,755 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:40,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,756 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:40,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:40,823 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-11-09 15:17:40,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-09 15:17:40,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:40,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-09 15:17:40,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-09 15:17:40,826 INFO L87 Difference]: Start difference. First operand 853 states and 2701 transitions. Second operand 4 states. [2020-11-09 15:17:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:40,906 INFO L93 Difference]: Finished difference Result 1191 states and 3675 transitions. [2020-11-09 15:17:40,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-09 15:17:40,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2020-11-09 15:17:40,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:40,916 INFO L225 Difference]: With dead ends: 1191 [2020-11-09 15:17:40,917 INFO L226 Difference]: Without dead ends: 517 [2020-11-09 15:17:40,917 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 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:17:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2020-11-09 15:17:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2020-11-09 15:17:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2020-11-09 15:17:40,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1477 transitions. [2020-11-09 15:17:40,942 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1477 transitions. Word has length 27 [2020-11-09 15:17:40,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:40,943 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1477 transitions. [2020-11-09 15:17:40,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-09 15:17:40,943 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1477 transitions. [2020-11-09 15:17:40,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 15:17:40,946 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:40,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:40,947 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-09 15:17:40,947 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:40,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash -2053313744, now seen corresponding path program 2 times [2020-11-09 15:17:40,952 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:40,953 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113686571] [2020-11-09 15:17:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:41,384 WARN L194 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 15 [2020-11-09 15:17:41,548 WARN L194 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 18 [2020-11-09 15:17:41,746 WARN L194 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2020-11-09 15:17:42,054 WARN L194 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 16 [2020-11-09 15:17:42,065 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:17:42,066 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113686571] [2020-11-09 15:17:42,067 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:42,067 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-09 15:17:42,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [614207846] [2020-11-09 15:17:42,067 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:42,074 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:42,150 INFO L252 McrAutomatonBuilder]: Finished intersection with 77 states and 122 transitions. [2020-11-09 15:17:42,150 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:42,180 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:17:42,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,184 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:17:42,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,191 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:42,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,194 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,197 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:42,198 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,390 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:17:42,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,394 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:17:42,394 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,400 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:42,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,402 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,403 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:42,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,691 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:42,692 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,693 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,694 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,695 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:42,695 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,778 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,778 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,780 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,781 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:42,781 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,874 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,876 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,878 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:42,878 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,973 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,974 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,976 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:42,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:42,977 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:42,978 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,090 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,092 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,095 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:43,096 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,185 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,187 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,189 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:43,190 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,297 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,299 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,299 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,300 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:43,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,419 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,421 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,422 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:43,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,527 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,528 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,529 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:43,529 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,530 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:43,530 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,533 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 4, 2, 3, 2, 1] term [2020-11-09 15:17:43,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,535 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 5, 3, 2, 1] term [2020-11-09 15:17:43,535 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:43,896 WARN L194 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2020-11-09 15:17:44,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,063 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,064 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,065 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:44,066 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,157 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,160 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,162 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:44,162 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,255 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,258 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,260 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:44,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,373 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,374 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,375 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,376 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,377 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:44,377 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,476 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,477 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,478 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,479 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:44,479 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,578 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,580 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,582 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:44,583 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,710 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,712 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-11-09 15:17:44,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,713 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[4, 2, 3, 2, 2, 1] term [2020-11-09 15:17:44,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:44,905 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [76673#(and (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd0~0 0) (= 2 ~y$w_buff0~0) (<= 0 ~y$r_buff0_thd0~0)), 76672#(and (not (= ~y~0 ~y$w_buff0~0)) (= (mod ~y$r_buff0_thd2~0 256) 0) (= ~y$w_buff1~0 0) (<= ~y$r_buff0_thd0~0 0) (= 2 ~y$w_buff0~0) (<= 0 ~y$r_buff0_thd0~0))] [2020-11-09 15:17:44,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-09 15:17:44,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:44,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-09 15:17:44,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:17:44,908 INFO L87 Difference]: Start difference. First operand 517 states and 1477 transitions. Second operand 9 states. [2020-11-09 15:17:45,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:45,290 INFO L93 Difference]: Finished difference Result 711 states and 2015 transitions. [2020-11-09 15:17:45,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-09 15:17:45,301 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-11-09 15:17:45,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:45,305 INFO L225 Difference]: With dead ends: 711 [2020-11-09 15:17:45,305 INFO L226 Difference]: Without dead ends: 661 [2020-11-09 15:17:45,307 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-11-09 15:17:45,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2020-11-09 15:17:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 493. [2020-11-09 15:17:45,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2020-11-09 15:17:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 1397 transitions. [2020-11-09 15:17:45,343 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 1397 transitions. Word has length 27 [2020-11-09 15:17:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:45,343 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 1397 transitions. [2020-11-09 15:17:45,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-09 15:17:45,344 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 1397 transitions. [2020-11-09 15:17:45,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 15:17:45,351 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:45,351 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:45,351 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-09 15:17:45,351 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:45,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:45,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1675337320, now seen corresponding path program 3 times [2020-11-09 15:17:45,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:45,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845579600] [2020-11-09 15:17:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-09 15:17:45,786 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 14 [2020-11-09 15:17:46,008 WARN L194 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 21 [2020-11-09 15:17:46,453 WARN L194 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 22 [2020-11-09 15:17:46,829 WARN L194 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 26 [2020-11-09 15:17:47,127 WARN L194 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 24 [2020-11-09 15:17:47,543 WARN L194 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 27 [2020-11-09 15:17:47,712 WARN L194 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 18 [2020-11-09 15:17:47,723 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:17:47,723 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845579600] [2020-11-09 15:17:47,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-09 15:17:47,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-09 15:17:47,724 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [506348663] [2020-11-09 15:17:47,724 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-11-09 15:17:47,729 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-11-09 15:17:47,799 INFO L252 McrAutomatonBuilder]: Finished intersection with 63 states and 91 transitions. [2020-11-09 15:17:47,802 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-11-09 15:17:47,833 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 3, 2, 1] term [2020-11-09 15:17:47,833 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:47,834 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 1] term [2020-11-09 15:17:47,834 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:47,836 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:47,837 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:47,838 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 8, 3, 8, 2, 1] term [2020-11-09 15:17:47,839 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:47,844 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-11-09 15:17:47,844 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:49,023 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 3, 2, 1] term [2020-11-09 15:17:49,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:49,024 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 8, 3, 2, 1] term [2020-11-09 15:17:49,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:49,026 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:49,027 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:49,028 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 8, 3, 8, 2, 1] term [2020-11-09 15:17:49,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:49,031 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 8, 4, 2, 3, 2, 1] term [2020-11-09 15:17:49,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:50,240 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:50,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:50,242 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-11-09 15:17:50,243 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:50,244 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 15:17:50,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:51,634 WARN L194 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 112 DAG size of output: 31 [2020-11-09 15:17:51,657 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:51,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:51,659 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-11-09 15:17:51,660 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:51,662 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 15:17:51,662 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:51,963 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:51,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:51,966 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-11-09 15:17:51,966 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:51,968 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 15:17:51,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:52,312 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:52,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:52,314 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-11-09 15:17:52,314 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:52,315 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 15:17:52,317 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:52,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:52,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:52,623 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-11-09 15:17:52,624 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:52,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 15:17:52,625 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:52,879 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:52,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:52,881 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-11-09 15:17:52,881 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:52,883 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 15:17:52,883 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:53,185 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:53,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:53,186 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-11-09 15:17:53,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:53,188 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 15:17:53,188 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:53,513 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-11-09 15:17:53,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:53,515 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 8, 3, 3, 2, 2, 1] term [2020-11-09 15:17:53,516 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-11-09 15:17:53,518 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[5, 8, 3, 2, 2, 1] term [2020-11-09 15:17:53,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-11-09 15:17:54,070 WARN L194 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2020-11-09 15:17:54,104 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 2 new interpolants: [78381#(and (or (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= 2 ~y$w_buff0~0)) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (= ~y$r_buff0_thd4~0 0)) (or (not (= (mod ~y$w_buff0_used~0 256) 0)) (<= 0 ~y$r_buff0_thd0~0)) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$w_buff0_used~0 256) 0)))), 78380#(and (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (<= 0 ~y$w_buff0_used~0)) (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1_used~0 0) (<= ~y$r_buff0_thd0~0 (* 256 (div ~y$r_buff0_thd0~0 256))) (or (<= ~y$w_buff0_used~0 0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (or (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (<= ~y$w_buff0_used~0 0)) (or (<= 0 ~y$w_buff0_used~0) (not (= (mod ~y$w_buff0_used~0 256) 0))) (= ~y$r_buff0_thd4~0 0) (<= 0 ~y$r_buff0_thd0~0) (not (= 2 ~y$w_buff1~0)))] [2020-11-09 15:17:54,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-09 15:17:54,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-09 15:17:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-09 15:17:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-11-09 15:17:54,106 INFO L87 Difference]: Start difference. First operand 493 states and 1397 transitions. Second operand 11 states. [2020-11-09 15:17:54,361 WARN L194 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2020-11-09 15:17:54,568 WARN L194 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2020-11-09 15:17:55,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-09 15:17:55,040 INFO L93 Difference]: Finished difference Result 655 states and 1827 transitions. [2020-11-09 15:17:55,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-09 15:17:55,043 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 27 [2020-11-09 15:17:55,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-09 15:17:55,046 INFO L225 Difference]: With dead ends: 655 [2020-11-09 15:17:55,046 INFO L226 Difference]: Without dead ends: 485 [2020-11-09 15:17:55,047 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 9 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2020-11-09 15:17:55,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2020-11-09 15:17:55,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 421. [2020-11-09 15:17:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2020-11-09 15:17:55,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 1169 transitions. [2020-11-09 15:17:55,068 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 1169 transitions. Word has length 27 [2020-11-09 15:17:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-09 15:17:55,068 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 1169 transitions. [2020-11-09 15:17:55,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-09 15:17:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 1169 transitions. [2020-11-09 15:17:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-09 15:17:55,071 INFO L414 BasicCegarLoop]: Found error trace [2020-11-09 15:17:55,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-09 15:17:55,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-09 15:17:55,071 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-09 15:17:55,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-09 15:17:55,072 INFO L82 PathProgramCache]: Analyzing trace with hash 608357654, now seen corresponding path program 4 times [2020-11-09 15:17:55,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-09 15:17:55,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77578002] [2020-11-09 15:17:55,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-09 15:17:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:17:55,165 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:17:55,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-09 15:17:55,279 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-09 15:17:55,377 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-09 15:17:55,378 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-09 15:17:55,379 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-09 15:17:55,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 03:17:55 BasicIcfg [2020-11-09 15:17:55,605 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-09 15:17:55,607 INFO L168 Benchmark]: Toolchain (without parser) took 105745.16 ms. Allocated memory was 154.1 MB in the beginning and 412.1 MB in the end (delta: 257.9 MB). Free memory was 128.6 MB in the beginning and 144.8 MB in the end (delta: -16.2 MB). Peak memory consumption was 242.7 MB. Max. memory is 8.0 GB. [2020-11-09 15:17:55,608 INFO L168 Benchmark]: CDTParser took 1.24 ms. Allocated memory is still 154.1 MB. Free memory is still 127.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-09 15:17:55,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1502.52 ms. Allocated memory is still 154.1 MB. Free memory was 127.9 MB in the beginning and 124.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:17:55,609 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.31 ms. Allocated memory is still 154.1 MB. Free memory was 124.8 MB in the beginning and 121.7 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:17:55,610 INFO L168 Benchmark]: Boogie Preprocessor took 114.41 ms. Allocated memory is still 154.1 MB. Free memory was 121.7 MB in the beginning and 119.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-09 15:17:55,611 INFO L168 Benchmark]: RCFGBuilder took 3553.91 ms. Allocated memory was 154.1 MB in the beginning and 196.1 MB in the end (delta: 41.9 MB). Free memory was 119.0 MB in the beginning and 96.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 77.8 MB. Max. memory is 8.0 GB. [2020-11-09 15:17:55,611 INFO L168 Benchmark]: TraceAbstraction took 100463.77 ms. Allocated memory was 196.1 MB in the beginning and 412.1 MB in the end (delta: 216.0 MB). Free memory was 95.7 MB in the beginning and 144.8 MB in the end (delta: -49.0 MB). Peak memory consumption was 166.5 MB. Max. memory is 8.0 GB. [2020-11-09 15:17:55,615 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24 ms. Allocated memory is still 154.1 MB. Free memory is still 127.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 1502.52 ms. Allocated memory is still 154.1 MB. Free memory was 127.9 MB in the beginning and 124.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 27.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 93.31 ms. Allocated memory is still 154.1 MB. Free memory was 124.8 MB in the beginning and 121.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 114.41 ms. Allocated memory is still 154.1 MB. Free memory was 121.7 MB in the beginning and 119.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 3553.91 ms. Allocated memory was 154.1 MB in the beginning and 196.1 MB in the end (delta: 41.9 MB). Free memory was 119.0 MB in the beginning and 96.3 MB in the end (delta: 22.8 MB). Peak memory consumption was 77.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 100463.77 ms. Allocated memory was 196.1 MB in the beginning and 412.1 MB in the end (delta: 216.0 MB). Free memory was 95.7 MB in the beginning and 144.8 MB in the end (delta: -49.0 MB). Peak memory consumption was 166.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1568 VarBasedMoverChecksPositive, 48 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 134 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 66.8s, 130 PlacesBefore, 46 PlacesAfterwards, 120 TransitionsBefore, 33 TransitionsAfterwards, 2862 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 105 TotalNumberOfCompositions, 8003 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L724] 0 int y = 0; [L725] 0 _Bool y$flush_delayed; [L726] 0 int y$mem_tmp; [L727] 0 _Bool y$r_buff0_thd0; [L728] 0 _Bool y$r_buff0_thd1; [L729] 0 _Bool y$r_buff0_thd2; [L730] 0 _Bool y$r_buff0_thd3; [L731] 0 _Bool y$r_buff0_thd4; [L732] 0 _Bool y$r_buff1_thd0; [L733] 0 _Bool y$r_buff1_thd1; [L734] 0 _Bool y$r_buff1_thd2; [L735] 0 _Bool y$r_buff1_thd3; [L736] 0 _Bool y$r_buff1_thd4; [L737] 0 _Bool y$read_delayed; [L738] 0 int *y$read_delayed_var; [L739] 0 int y$w_buff0; [L740] 0 _Bool y$w_buff0_used; [L741] 0 int y$w_buff1; [L742] 0 _Bool y$w_buff1_used; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L846] 0 pthread_t t781; [L847] FCALL, FORK 0 pthread_create(&t781, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t782; [L849] FCALL, FORK 0 pthread_create(&t782, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t783; [L851] FCALL, FORK 0 pthread_create(&t783, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 2 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L790] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L791] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L792] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L793] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L794] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L795] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] 0 pthread_t t784; [L853] FCALL, FORK 0 pthread_create(&t784, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L815] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L821] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L824] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L827] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L828] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L828] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L833] 4 return 0; [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L768] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L804] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L804] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L805] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L808] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L810] 3 return 0; [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L862] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L862] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L863] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L863] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 y$flush_delayed = weak$$choice2 [L869] 0 y$mem_tmp = y [L870] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L870] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L871] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L871] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L871] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L872] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L872] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L872] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L873] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L873] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L875] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L875] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L878] 0 y = y$flush_delayed ? y$mem_tmp : y [L879] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix029_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 118 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 100.0s, OverallIterations: 14, TraceHistogramMax: 1, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 67.2s, HoareTripleCheckerStatistics: 446 SDtfs, 779 SDslu, 981 SDs, 0 SdLazy, 401 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 347 GetRequests, 244 SyntacticMatches, 32 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 9.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3890occurred 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: 1.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 1144 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 53203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...