/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/pthread-wmm/safe005_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 11:06:20,495 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 11:06:20,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 11:06:20,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 11:06:20,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 11:06:20,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 11:06:20,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 11:06:20,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 11:06:20,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 11:06:20,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 11:06:20,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 11:06:20,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 11:06:20,555 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 11:06:20,556 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 11:06:20,557 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 11:06:20,559 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 11:06:20,560 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 11:06:20,561 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 11:06:20,563 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 11:06:20,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 11:06:20,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 11:06:20,572 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 11:06:20,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 11:06:20,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 11:06:20,589 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 11:06:20,589 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 11:06:20,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 11:06:20,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 11:06:20,591 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 11:06:20,592 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 11:06:20,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 11:06:20,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 11:06:20,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 11:06:20,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 11:06:20,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 11:06:20,597 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 11:06:20,598 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 11:06:20,600 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 11:06:20,600 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 11:06:20,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 11:06:20,602 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 11:06:20,603 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 11:06:20,630 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 11:06:20,630 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 11:06:20,632 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 11:06:20,632 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 11:06:20,632 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 11:06:20,633 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 11:06:20,633 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 11:06:20,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 11:06:20,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 11:06:20,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 11:06:20,634 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 11:06:20,634 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 11:06:20,634 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 11:06:20,634 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 11:06:20,635 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 11:06:20,635 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 11:06:20,635 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 11:06:20,635 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 11:06:20,635 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 11:06:20,636 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 11:06:20,636 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 11:06:20,636 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 11:06:20,636 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 11:06:20,637 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 11:06:20,637 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 11:06:20,637 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-12-22 11:06:20,995 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 11:06:21,035 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 11:06:21,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 11:06:21,040 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 11:06:21,040 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 11:06:21,041 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe005_power.opt.i [2020-12-22 11:06:21,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d727ece8f/259ca45690084134806f86c4dea5190e/FLAGbf4a6a5c1 [2020-12-22 11:06:21,767 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 11:06:21,768 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.opt.i [2020-12-22 11:06:21,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d727ece8f/259ca45690084134806f86c4dea5190e/FLAGbf4a6a5c1 [2020-12-22 11:06:22,044 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d727ece8f/259ca45690084134806f86c4dea5190e [2020-12-22 11:06:22,052 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 11:06:22,056 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 11:06:22,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 11:06:22,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 11:06:22,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 11:06:22,066 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:22,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f5305e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22, skipping insertion in model container [2020-12-22 11:06:22,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:22,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 11:06:22,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 11:06:22,422 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.opt.i[994,1007] [2020-12-22 11:06:22,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:06:22,684 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 11:06:22,698 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe005_power.opt.i[994,1007] [2020-12-22 11:06:22,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 11:06:22,912 INFO L208 MainTranslator]: Completed translation [2020-12-22 11:06:22,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22 WrapperNode [2020-12-22 11:06:22,913 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 11:06:22,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 11:06:22,914 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 11:06:22,914 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 11:06:22,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:22,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:22,976 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 11:06:22,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 11:06:22,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 11:06:22,983 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 11:06:22,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:22,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:23,012 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:23,013 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:23,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:23,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:23,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (1/1) ... [2020-12-22 11:06:23,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 11:06:23,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 11:06:23,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 11:06:23,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 11:06:23,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (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-12-22 11:06:23,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-22 11:06:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-22 11:06:23,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 11:06:23,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-22 11:06:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-22 11:06:23,166 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-22 11:06:23,166 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-22 11:06:23,167 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-22 11:06:23,167 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-22 11:06:23,168 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-22 11:06:23,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 11:06:23,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-22 11:06:23,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 11:06:23,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 11:06:23,174 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-22 11:06:24,989 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 11:06:24,990 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-22 11:06:24,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:06:24 BoogieIcfgContainer [2020-12-22 11:06:24,992 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 11:06:24,994 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 11:06:24,994 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 11:06:24,997 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 11:06:24,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:06:22" (1/3) ... [2020-12-22 11:06:24,998 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e26adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:06:24, skipping insertion in model container [2020-12-22 11:06:24,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:06:22" (2/3) ... [2020-12-22 11:06:24,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e26adc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:06:24, skipping insertion in model container [2020-12-22 11:06:24,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:06:24" (3/3) ... [2020-12-22 11:06:25,000 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_power.opt.i [2020-12-22 11:06:25,008 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-22 11:06:25,008 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 11:06:25,013 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-22 11:06:25,014 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-22 11:06:25,048 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,049 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,049 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,050 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,050 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,051 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,052 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,053 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,054 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,055 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,056 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,058 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,059 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,060 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,061 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,062 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,063 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,064 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,066 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,067 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,067 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,067 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,068 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,068 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,068 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,068 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,069 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,069 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,069 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,069 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,070 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,071 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,072 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,073 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,074 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,074 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,074 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,075 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,075 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,075 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,075 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,076 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,077 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,078 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,079 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,081 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,082 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,082 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,083 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,083 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,084 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,085 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,086 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,088 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,088 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,089 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,089 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,090 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,091 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,092 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,092 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,092 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,093 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-22 11:06:25,094 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-22 11:06:25,110 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-22 11:06:25,129 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 11:06:25,130 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 11:06:25,130 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 11:06:25,130 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 11:06:25,130 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 11:06:25,130 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 11:06:25,130 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 11:06:25,131 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 11:06:25,143 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-22 11:06:25,145 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2020-12-22 11:06:25,149 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2020-12-22 11:06:25,151 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2020-12-22 11:06:25,197 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2020-12-22 11:06:25,198 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-22 11:06:25,202 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-12-22 11:06:25,205 INFO L116 LiptonReduction]: Number of co-enabled transitions 1586 [2020-12-22 11:06:25,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:25,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:25,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:25,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:25,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:25,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:25,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:25,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:25,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:25,436 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,436 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:25,439 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,440 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:25,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,584 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:06:25,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,588 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:25,855 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,855 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:06:25,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:25,920 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:25,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:25,925 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:25,926 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:25,927 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:25,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:25,932 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:25,932 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:25,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:25,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:25,939 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:25,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:26,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-22 11:06:26,215 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:26,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2020-12-22 11:06:26,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:26,218 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2020-12-22 11:06:26,218 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:27,032 WARN L197 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-12-22 11:06:27,629 WARN L197 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 81 [2020-12-22 11:06:27,815 WARN L197 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-12-22 11:06:27,927 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:27,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:27,932 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:27,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:27,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:27,934 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:27,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:27,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:27,940 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:27,940 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:27,942 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:27,942 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:27,944 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:27,944 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,015 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:28,016 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-22 11:06:28,019 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:28,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,139 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,139 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,140 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,164 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,164 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,165 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,165 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,167 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,167 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:28,169 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:28,319 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:28,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:06:28,322 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:28,322 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,378 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:28,378 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:28,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:28,380 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:28,381 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:28,382 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:28,383 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:28,384 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,385 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:28,386 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:28,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,723 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,726 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,726 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:28,728 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,728 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:28,745 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,746 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,746 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,747 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:28,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:28,750 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:28,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,001 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,001 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,002 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,003 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,004 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,005 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,024 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,026 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,026 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:29,028 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,028 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:29,205 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,206 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,206 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,242 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,245 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:29,247 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,248 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:29,477 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:29,482 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:29,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:29,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:29,485 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:29,485 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:29,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,491 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:06:29,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,574 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,576 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:29,578 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,579 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:29,597 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,597 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,598 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,633 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,634 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,635 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,654 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,656 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,656 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:29,658 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,658 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:29,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:06:29,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,708 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:29,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:29,753 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:29,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:29,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:29,754 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:29,755 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:29,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:29,758 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,758 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,760 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,760 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:29,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:29,761 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:30,014 WARN L197 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2020-12-22 11:06:30,417 WARN L197 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 88 [2020-12-22 11:06:30,620 WARN L197 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-12-22 11:06:30,821 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:30,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:30,823 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,824 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:30,825 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,826 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:30,842 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,842 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:30,843 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,843 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:30,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:30,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:30,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:30,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:30,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:30,987 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:30,987 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,006 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,009 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,010 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:31,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,012 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:31,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,238 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:31,239 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:31,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:31,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:31,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:31,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:31,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,245 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,246 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,247 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,294 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:06:31,296 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,297 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:31,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:31,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,446 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,447 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,447 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,449 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,449 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,475 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,475 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,476 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,495 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,495 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,497 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,497 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:31,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:31,547 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,548 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-22 11:06:31,550 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,550 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,622 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:31,622 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:31,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:31,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:31,627 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-22 11:06:31,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:31,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-22 11:06:31,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-22 11:06:31,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,631 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,632 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-22 11:06:31,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:31,776 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-12-22 11:06:31,930 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-12-22 11:06:32,018 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:32,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:32,019 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:32,019 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:32,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:32,021 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:32,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:32,023 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-22 11:06:32,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:32,040 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:32,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:32,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-22 11:06:32,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:32,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:32,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-22 11:06:32,044 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-22 11:06:32,610 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-12-22 11:06:32,737 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-12-22 11:06:32,850 WARN L197 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-12-22 11:06:33,315 WARN L197 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-22 11:06:33,538 WARN L197 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-22 11:06:34,018 WARN L197 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-12-22 11:06:34,236 WARN L197 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-12-22 11:06:34,241 INFO L131 LiptonReduction]: Checked pairs total: 4140 [2020-12-22 11:06:34,241 INFO L133 LiptonReduction]: Total number of compositions: 84 [2020-12-22 11:06:34,248 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 26 transitions, 67 flow [2020-12-22 11:06:34,290 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 658 states. [2020-12-22 11:06:34,293 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states. [2020-12-22 11:06:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-12-22 11:06:34,298 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:34,299 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-12-22 11:06:34,299 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:34,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:34,305 INFO L82 PathProgramCache]: Analyzing trace with hash 930661930, now seen corresponding path program 1 times [2020-12-22 11:06:34,314 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:34,315 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104747110] [2020-12-22 11:06:34,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:34,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:34,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:34,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104747110] [2020-12-22 11:06:34,577 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:34,577 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 11:06:34,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968416736] [2020-12-22 11:06:34,584 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 11:06:34,584 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:34,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 11:06:34,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 11:06:34,605 INFO L87 Difference]: Start difference. First operand 658 states. Second operand 3 states. [2020-12-22 11:06:34,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:34,691 INFO L93 Difference]: Finished difference Result 550 states and 1693 transitions. [2020-12-22 11:06:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 11:06:34,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-12-22 11:06:34,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:34,715 INFO L225 Difference]: With dead ends: 550 [2020-12-22 11:06:34,715 INFO L226 Difference]: Without dead ends: 450 [2020-12-22 11:06:34,716 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-12-22 11:06:34,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2020-12-22 11:06:34,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2020-12-22 11:06:34,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2020-12-22 11:06:34,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 1358 transitions. [2020-12-22 11:06:34,810 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 1358 transitions. Word has length 5 [2020-12-22 11:06:34,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:34,810 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 1358 transitions. [2020-12-22 11:06:34,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 11:06:34,810 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 1358 transitions. [2020-12-22 11:06:34,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-12-22 11:06:34,812 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:34,812 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:34,812 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 11:06:34,813 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:34,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:34,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1495384950, now seen corresponding path program 1 times [2020-12-22 11:06:34,813 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:34,814 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659578238] [2020-12-22 11:06:34,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:34,973 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659578238] [2020-12-22 11:06:34,973 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:34,973 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-22 11:06:34,974 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270658714] [2020-12-22 11:06:34,975 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 11:06:34,975 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:34,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 11:06:34,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 11:06:34,976 INFO L87 Difference]: Start difference. First operand 450 states and 1358 transitions. Second operand 3 states. [2020-12-22 11:06:34,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:34,994 INFO L93 Difference]: Finished difference Result 440 states and 1320 transitions. [2020-12-22 11:06:34,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 11:06:34,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-12-22 11:06:34,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:35,000 INFO L225 Difference]: With dead ends: 440 [2020-12-22 11:06:35,001 INFO L226 Difference]: Without dead ends: 440 [2020-12-22 11:06:35,001 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-12-22 11:06:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2020-12-22 11:06:35,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2020-12-22 11:06:35,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2020-12-22 11:06:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 1320 transitions. [2020-12-22 11:06:35,030 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 1320 transitions. Word has length 9 [2020-12-22 11:06:35,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:35,031 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 1320 transitions. [2020-12-22 11:06:35,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 11:06:35,032 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 1320 transitions. [2020-12-22 11:06:35,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 11:06:35,033 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:35,034 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:35,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 11:06:35,034 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:35,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:35,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1019735399, now seen corresponding path program 1 times [2020-12-22 11:06:35,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:35,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424063370] [2020-12-22 11:06:35,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:35,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:35,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424063370] [2020-12-22 11:06:35,186 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:35,186 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 11:06:35,186 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579584461] [2020-12-22 11:06:35,186 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:06:35,187 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:06:35,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:06:35,188 INFO L87 Difference]: Start difference. First operand 440 states and 1320 transitions. Second operand 4 states. [2020-12-22 11:06:35,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:35,223 INFO L93 Difference]: Finished difference Result 644 states and 1852 transitions. [2020-12-22 11:06:35,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 11:06:35,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-22 11:06:35,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:35,232 INFO L225 Difference]: With dead ends: 644 [2020-12-22 11:06:35,233 INFO L226 Difference]: Without dead ends: 470 [2020-12-22 11:06:35,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:06:35,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-12-22 11:06:35,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 416. [2020-12-22 11:06:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2020-12-22 11:06:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1187 transitions. [2020-12-22 11:06:35,259 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1187 transitions. Word has length 10 [2020-12-22 11:06:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:35,259 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 1187 transitions. [2020-12-22 11:06:35,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:06:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1187 transitions. [2020-12-22 11:06:35,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 11:06:35,267 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:35,267 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:35,267 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-22 11:06:35,267 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:35,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:35,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1749076430, now seen corresponding path program 1 times [2020-12-22 11:06:35,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:35,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802960564] [2020-12-22 11:06:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:35,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802960564] [2020-12-22 11:06:35,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:35,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 11:06:35,427 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945952111] [2020-12-22 11:06:35,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:06:35,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:35,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:06:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:35,429 INFO L87 Difference]: Start difference. First operand 416 states and 1187 transitions. Second operand 5 states. [2020-12-22 11:06:35,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:35,480 INFO L93 Difference]: Finished difference Result 699 states and 1915 transitions. [2020-12-22 11:06:35,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:06:35,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-22 11:06:35,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:35,484 INFO L225 Difference]: With dead ends: 699 [2020-12-22 11:06:35,484 INFO L226 Difference]: Without dead ends: 405 [2020-12-22 11:06:35,485 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:06:35,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2020-12-22 11:06:35,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 360. [2020-12-22 11:06:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-22 11:06:35,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 987 transitions. [2020-12-22 11:06:35,497 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 987 transitions. Word has length 11 [2020-12-22 11:06:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:35,497 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 987 transitions. [2020-12-22 11:06:35,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:06:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 987 transitions. [2020-12-22 11:06:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-22 11:06:35,498 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:35,499 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:35,499 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-22 11:06:35,499 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:35,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:35,499 INFO L82 PathProgramCache]: Analyzing trace with hash -713207560, now seen corresponding path program 1 times [2020-12-22 11:06:35,500 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:35,500 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988402667] [2020-12-22 11:06:35,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:35,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:35,648 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988402667] [2020-12-22 11:06:35,648 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:35,648 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 11:06:35,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547389706] [2020-12-22 11:06:35,649 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:06:35,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:35,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:06:35,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:35,651 INFO L87 Difference]: Start difference. First operand 360 states and 987 transitions. Second operand 5 states. [2020-12-22 11:06:35,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:35,757 INFO L93 Difference]: Finished difference Result 701 states and 1851 transitions. [2020-12-22 11:06:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 11:06:35,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-22 11:06:35,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:35,761 INFO L225 Difference]: With dead ends: 701 [2020-12-22 11:06:35,761 INFO L226 Difference]: Without dead ends: 398 [2020-12-22 11:06:35,762 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:06:35,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2020-12-22 11:06:35,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 272. [2020-12-22 11:06:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-12-22 11:06:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 728 transitions. [2020-12-22 11:06:35,773 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 728 transitions. Word has length 12 [2020-12-22 11:06:35,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:35,773 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 728 transitions. [2020-12-22 11:06:35,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:06:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 728 transitions. [2020-12-22 11:06:35,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-22 11:06:35,774 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:35,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:35,774 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-22 11:06:35,774 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:35,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:35,775 INFO L82 PathProgramCache]: Analyzing trace with hash 348257748, now seen corresponding path program 1 times [2020-12-22 11:06:35,775 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:35,775 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531605840] [2020-12-22 11:06:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:35,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:35,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:35,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531605840] [2020-12-22 11:06:35,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:35,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 11:06:35,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402396948] [2020-12-22 11:06:35,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:06:35,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:06:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:06:35,842 INFO L87 Difference]: Start difference. First operand 272 states and 728 transitions. Second operand 4 states. [2020-12-22 11:06:35,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:35,862 INFO L93 Difference]: Finished difference Result 263 states and 698 transitions. [2020-12-22 11:06:35,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 11:06:35,863 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-22 11:06:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:35,865 INFO L225 Difference]: With dead ends: 263 [2020-12-22 11:06:35,865 INFO L226 Difference]: Without dead ends: 245 [2020-12-22 11:06:35,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:06:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2020-12-22 11:06:35,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 236. [2020-12-22 11:06:35,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2020-12-22 11:06:35,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 626 transitions. [2020-12-22 11:06:35,874 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 626 transitions. Word has length 13 [2020-12-22 11:06:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:35,875 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 626 transitions. [2020-12-22 11:06:35,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:06:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 626 transitions. [2020-12-22 11:06:35,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-22 11:06:35,876 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:35,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:35,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-22 11:06:35,876 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:35,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:35,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2088955066, now seen corresponding path program 1 times [2020-12-22 11:06:35,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:35,877 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67841644] [2020-12-22 11:06:35,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:35,941 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67841644] [2020-12-22 11:06:35,941 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:35,942 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-22 11:06:35,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104573557] [2020-12-22 11:06:35,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-22 11:06:35,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-22 11:06:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-22 11:06:35,943 INFO L87 Difference]: Start difference. First operand 236 states and 626 transitions. Second operand 4 states. [2020-12-22 11:06:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:35,974 INFO L93 Difference]: Finished difference Result 233 states and 547 transitions. [2020-12-22 11:06:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-22 11:06:35,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-22 11:06:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:35,976 INFO L225 Difference]: With dead ends: 233 [2020-12-22 11:06:35,976 INFO L226 Difference]: Without dead ends: 172 [2020-12-22 11:06:35,976 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-22 11:06:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2020-12-22 11:06:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2020-12-22 11:06:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 394 transitions. [2020-12-22 11:06:35,983 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 394 transitions. Word has length 14 [2020-12-22 11:06:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:35,983 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 394 transitions. [2020-12-22 11:06:35,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-22 11:06:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 394 transitions. [2020-12-22 11:06:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 11:06:35,984 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:35,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:35,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-22 11:06:35,984 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:35,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:35,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1118605009, now seen corresponding path program 1 times [2020-12-22 11:06:35,985 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:35,985 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710121854] [2020-12-22 11:06:35,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:36,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:36,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710121854] [2020-12-22 11:06:36,065 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:36,065 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-22 11:06:36,065 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814059685] [2020-12-22 11:06:36,065 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-22 11:06:36,066 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:36,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-22 11:06:36,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-22 11:06:36,067 INFO L87 Difference]: Start difference. First operand 172 states and 394 transitions. Second operand 3 states. [2020-12-22 11:06:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:36,081 INFO L93 Difference]: Finished difference Result 242 states and 555 transitions. [2020-12-22 11:06:36,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-22 11:06:36,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-22 11:06:36,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:36,082 INFO L225 Difference]: With dead ends: 242 [2020-12-22 11:06:36,083 INFO L226 Difference]: Without dead ends: 153 [2020-12-22 11:06:36,083 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-12-22 11:06:36,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-12-22 11:06:36,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-12-22 11:06:36,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-12-22 11:06:36,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 355 transitions. [2020-12-22 11:06:36,088 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 355 transitions. Word has length 16 [2020-12-22 11:06:36,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:36,088 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 355 transitions. [2020-12-22 11:06:36,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-22 11:06:36,088 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 355 transitions. [2020-12-22 11:06:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-22 11:06:36,089 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:36,089 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:36,089 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 11:06:36,089 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:36,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash 367831138, now seen corresponding path program 1 times [2020-12-22 11:06:36,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:36,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093170653] [2020-12-22 11:06:36,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:36,161 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093170653] [2020-12-22 11:06:36,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:36,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 11:06:36,162 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366518746] [2020-12-22 11:06:36,162 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:06:36,162 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:36,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:06:36,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:36,163 INFO L87 Difference]: Start difference. First operand 153 states and 355 transitions. Second operand 5 states. [2020-12-22 11:06:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:36,214 INFO L93 Difference]: Finished difference Result 127 states and 260 transitions. [2020-12-22 11:06:36,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:06:36,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-12-22 11:06:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:36,216 INFO L225 Difference]: With dead ends: 127 [2020-12-22 11:06:36,216 INFO L226 Difference]: Without dead ends: 95 [2020-12-22 11:06:36,216 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:06:36,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-22 11:06:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-12-22 11:06:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-12-22 11:06:36,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 185 transitions. [2020-12-22 11:06:36,219 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 185 transitions. Word has length 16 [2020-12-22 11:06:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:36,220 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 185 transitions. [2020-12-22 11:06:36,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:06:36,220 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 185 transitions. [2020-12-22 11:06:36,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:06:36,220 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:36,220 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:36,220 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-22 11:06:36,221 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:36,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:36,221 INFO L82 PathProgramCache]: Analyzing trace with hash 941937179, now seen corresponding path program 1 times [2020-12-22 11:06:36,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:36,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59016435] [2020-12-22 11:06:36,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:36,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:36,354 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59016435] [2020-12-22 11:06:36,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:36,354 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 11:06:36,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266511978] [2020-12-22 11:06:36,355 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:06:36,355 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:36,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:06:36,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:36,356 INFO L87 Difference]: Start difference. First operand 95 states and 185 transitions. Second operand 5 states. [2020-12-22 11:06:36,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:36,456 INFO L93 Difference]: Finished difference Result 117 states and 223 transitions. [2020-12-22 11:06:36,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:06:36,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-12-22 11:06:36,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:36,457 INFO L225 Difference]: With dead ends: 117 [2020-12-22 11:06:36,457 INFO L226 Difference]: Without dead ends: 95 [2020-12-22 11:06:36,457 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:06:36,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-12-22 11:06:36,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2020-12-22 11:06:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-12-22 11:06:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 181 transitions. [2020-12-22 11:06:36,460 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 181 transitions. Word has length 18 [2020-12-22 11:06:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:36,461 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 181 transitions. [2020-12-22 11:06:36,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:06:36,461 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 181 transitions. [2020-12-22 11:06:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-22 11:06:36,461 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:36,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 11:06:36,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-22 11:06:36,462 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash 960903480, now seen corresponding path program 1 times [2020-12-22 11:06:36,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:36,463 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589826664] [2020-12-22 11:06:36,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:36,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:36,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:36,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589826664] [2020-12-22 11:06:36,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:36,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:06:36,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963531317] [2020-12-22 11:06:36,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-22 11:06:36,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:36,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-22 11:06:36,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:06:36,589 INFO L87 Difference]: Start difference. First operand 95 states and 181 transitions. Second operand 6 states. [2020-12-22 11:06:36,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:36,650 INFO L93 Difference]: Finished difference Result 82 states and 153 transitions. [2020-12-22 11:06:36,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-22 11:06:36,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-12-22 11:06:36,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:36,653 INFO L225 Difference]: With dead ends: 82 [2020-12-22 11:06:36,653 INFO L226 Difference]: Without dead ends: 73 [2020-12-22 11:06:36,654 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:06:36,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-12-22 11:06:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 64. [2020-12-22 11:06:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-22 11:06:36,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 118 transitions. [2020-12-22 11:06:36,656 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 118 transitions. Word has length 18 [2020-12-22 11:06:36,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:36,656 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 118 transitions. [2020-12-22 11:06:36,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-22 11:06:36,656 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 118 transitions. [2020-12-22 11:06:36,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:06:36,657 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:36,657 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-12-22 11:06:36,657 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-22 11:06:36,657 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:36,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:36,658 INFO L82 PathProgramCache]: Analyzing trace with hash -893799797, now seen corresponding path program 1 times [2020-12-22 11:06:36,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:36,658 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590525026] [2020-12-22 11:06:36,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:36,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:36,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590525026] [2020-12-22 11:06:36,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:36,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-22 11:06:36,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243304476] [2020-12-22 11:06:36,804 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 11:06:36,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 11:06:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-22 11:06:36,805 INFO L87 Difference]: Start difference. First operand 64 states and 118 transitions. Second operand 5 states. [2020-12-22 11:06:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:36,837 INFO L93 Difference]: Finished difference Result 93 states and 172 transitions. [2020-12-22 11:06:36,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 11:06:36,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-12-22 11:06:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:36,839 INFO L225 Difference]: With dead ends: 93 [2020-12-22 11:06:36,839 INFO L226 Difference]: Without dead ends: 61 [2020-12-22 11:06:36,843 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-12-22 11:06:36,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-12-22 11:06:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-12-22 11:06:36,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-22 11:06:36,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2020-12-22 11:06:36,845 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 20 [2020-12-22 11:06:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:36,846 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2020-12-22 11:06:36,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 11:06:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2020-12-22 11:06:36,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:06:36,847 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:36,847 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-12-22 11:06:36,847 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-22 11:06:36,847 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:36,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:36,848 INFO L82 PathProgramCache]: Analyzing trace with hash -45673839, now seen corresponding path program 2 times [2020-12-22 11:06:36,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:36,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931244050] [2020-12-22 11:06:36,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:36,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:37,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931244050] [2020-12-22 11:06:37,150 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:37,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:06:37,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380364620] [2020-12-22 11:06:37,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:06:37,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:06:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:06:37,154 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand 7 states. [2020-12-22 11:06:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:37,351 INFO L93 Difference]: Finished difference Result 79 states and 140 transitions. [2020-12-22 11:06:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 11:06:37,351 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-22 11:06:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:37,352 INFO L225 Difference]: With dead ends: 79 [2020-12-22 11:06:37,352 INFO L226 Difference]: Without dead ends: 49 [2020-12-22 11:06:37,352 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-12-22 11:06:37,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-12-22 11:06:37,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-12-22 11:06:37,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-12-22 11:06:37,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 84 transitions. [2020-12-22 11:06:37,354 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 84 transitions. Word has length 20 [2020-12-22 11:06:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:37,354 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 84 transitions. [2020-12-22 11:06:37,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:06:37,355 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 84 transitions. [2020-12-22 11:06:37,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:06:37,355 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:37,355 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-12-22 11:06:37,355 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-22 11:06:37,355 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:37,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:37,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1809609007, now seen corresponding path program 3 times [2020-12-22 11:06:37,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:37,356 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647619279] [2020-12-22 11:06:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:37,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 11:06:37,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 11:06:37,608 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647619279] [2020-12-22 11:06:37,609 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 11:06:37,609 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 11:06:37,609 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564620796] [2020-12-22 11:06:37,609 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-22 11:06:37,609 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 11:06:37,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-22 11:06:37,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-22 11:06:37,610 INFO L87 Difference]: Start difference. First operand 49 states and 84 transitions. Second operand 7 states. [2020-12-22 11:06:37,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 11:06:37,780 INFO L93 Difference]: Finished difference Result 59 states and 98 transitions. [2020-12-22 11:06:37,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 11:06:37,781 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-22 11:06:37,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 11:06:37,781 INFO L225 Difference]: With dead ends: 59 [2020-12-22 11:06:37,781 INFO L226 Difference]: Without dead ends: 41 [2020-12-22 11:06:37,782 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-22 11:06:37,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-12-22 11:06:37,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-12-22 11:06:37,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-12-22 11:06:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 64 transitions. [2020-12-22 11:06:37,783 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 64 transitions. Word has length 20 [2020-12-22 11:06:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 11:06:37,784 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 64 transitions. [2020-12-22 11:06:37,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-22 11:06:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 64 transitions. [2020-12-22 11:06:37,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-22 11:06:37,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 11:06:37,784 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-12-22 11:06:37,785 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-22 11:06:37,785 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 11:06:37,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 11:06:37,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1093620497, now seen corresponding path program 4 times [2020-12-22 11:06:37,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 11:06:37,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835384293] [2020-12-22 11:06:37,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 11:06:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 11:06:37,858 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 11:06:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 11:06:37,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 11:06:37,939 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 11:06:37,940 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 11:06:37,940 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-22 11:06:38,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 11:06:38 BasicIcfg [2020-12-22 11:06:38,028 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 11:06:38,028 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 11:06:38,028 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 11:06:38,028 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 11:06:38,029 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:06:24" (3/4) ... [2020-12-22 11:06:38,031 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 11:06:38,190 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/pthread-wmm/safe005_power.opt.i-witness.graphml [2020-12-22 11:06:38,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 11:06:38,191 INFO L168 Benchmark]: Toolchain (without parser) took 16136.33 ms. Allocated memory was 160.4 MB in the beginning and 352.3 MB in the end (delta: 191.9 MB). Free memory was 133.4 MB in the beginning and 184.1 MB in the end (delta: -50.7 MB). Peak memory consumption was 143.4 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:38,192 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 160.4 MB. Free memory is still 133.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 11:06:38,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 854.05 ms. Allocated memory is still 160.4 MB. Free memory was 133.2 MB in the beginning and 130.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:38,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.71 ms. Allocated memory is still 160.4 MB. Free memory was 130.0 MB in the beginning and 127.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:38,193 INFO L168 Benchmark]: Boogie Preprocessor took 85.75 ms. Allocated memory is still 160.4 MB. Free memory was 127.5 MB in the beginning and 125.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:38,193 INFO L168 Benchmark]: RCFGBuilder took 1923.68 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 125.4 MB in the beginning and 125.3 MB in the end (delta: 94.0 kB). Peak memory consumption was 80.2 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:38,193 INFO L168 Benchmark]: TraceAbstraction took 13033.65 ms. Allocated memory was 192.9 MB in the beginning and 352.3 MB in the end (delta: 159.4 MB). Free memory was 124.9 MB in the beginning and 199.3 MB in the end (delta: -74.4 MB). Peak memory consumption was 85.0 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:38,194 INFO L168 Benchmark]: Witness Printer took 162.10 ms. Allocated memory is still 352.3 MB. Free memory was 199.3 MB in the beginning and 184.1 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. [2020-12-22 11:06:38,196 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 160.4 MB. Free memory is still 133.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 854.05 ms. Allocated memory is still 160.4 MB. Free memory was 133.2 MB in the beginning and 130.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 27.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 62.71 ms. Allocated memory is still 160.4 MB. Free memory was 130.0 MB in the beginning and 127.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 85.75 ms. Allocated memory is still 160.4 MB. Free memory was 127.5 MB in the beginning and 125.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1923.68 ms. Allocated memory was 160.4 MB in the beginning and 192.9 MB in the end (delta: 32.5 MB). Free memory was 125.4 MB in the beginning and 125.3 MB in the end (delta: 94.0 kB). Peak memory consumption was 80.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13033.65 ms. Allocated memory was 192.9 MB in the beginning and 352.3 MB in the end (delta: 159.4 MB). Free memory was 124.9 MB in the beginning and 199.3 MB in the end (delta: -74.4 MB). Peak memory consumption was 85.0 MB. Max. memory is 8.0 GB. * Witness Printer took 162.10 ms. Allocated memory is still 352.3 MB. Free memory was 199.3 MB in the beginning and 184.1 MB in the end (delta: 15.2 MB). Peak memory consumption was 15.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 945 VarBasedMoverChecksPositive, 59 VarBasedMoverChecksNegative, 11 SemBasedMoverChecksPositive, 48 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 85 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 9.0s, 105 PlacesBefore, 35 PlacesAfterwards, 97 TransitionsBefore, 26 TransitionsAfterwards, 1586 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 4140 MoverChecksTotal - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p2_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L831] 0 pthread_t t1900; [L832] FCALL, FORK 0 pthread_create(&t1900, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L833] 0 pthread_t t1901; [L834] FCALL, FORK 0 pthread_create(&t1901, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L835] 0 pthread_t t1902; [L836] FCALL, FORK 0 pthread_create(&t1902, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L744] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EAX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND FALSE 0 !(!cond) [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L842] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L849] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.8s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.1s, HoareTripleCheckerStatistics: 292 SDtfs, 376 SDslu, 460 SDs, 0 SdLazy, 235 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=658occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 243 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 20811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...