/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 00:32:52,382 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 00:32:52,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 00:32:52,425 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 00:32:52,426 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 00:32:52,433 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 00:32:52,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 00:32:52,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 00:32:52,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 00:32:52,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 00:32:52,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 00:32:52,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 00:32:52,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 00:32:52,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 00:32:52,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 00:32:52,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 00:32:52,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 00:32:52,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 00:32:52,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 00:32:52,467 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 00:32:52,469 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 00:32:52,471 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 00:32:52,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 00:32:52,472 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 00:32:52,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 00:32:52,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 00:32:52,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 00:32:52,489 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 00:32:52,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 00:32:52,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 00:32:52,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 00:32:52,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 00:32:52,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 00:32:52,493 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 00:32:52,494 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 00:32:52,494 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 00:32:52,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 00:32:52,495 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 00:32:52,495 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 00:32:52,497 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 00:32:52,498 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 00:32:52,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-McrAutomaton-WP.epf [2020-10-22 00:32:52,533 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 00:32:52,534 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 00:32:52,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 00:32:52,536 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 00:32:52,537 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 00:32:52,537 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 00:32:52,537 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 00:32:52,538 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 00:32:52,538 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 00:32:52,538 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 00:32:52,539 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 00:32:52,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 00:32:52,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 00:32:52,540 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 00:32:52,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 00:32:52,541 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 00:32:52,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 00:32:52,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 00:32:52,541 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 00:32:52,541 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 00:32:52,541 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 00:32:52,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:32:52,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 00:32:52,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 00:32:52,542 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 00:32:52,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 00:32:52,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 00:32:52,543 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 00:32:52,543 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 00:32:52,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 00:32:52,544 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 00:32:52,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 00:32:52,860 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 00:32:52,864 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 00:32:52,866 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 00:32:52,866 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 00:32:52,867 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i [2020-10-22 00:32:52,934 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254bec1e1/f266418196dd4b66ac4ba1212457ef29/FLAG29d3fd779 [2020-10-22 00:32:53,480 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 00:32:53,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_rmo.opt.i [2020-10-22 00:32:53,512 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254bec1e1/f266418196dd4b66ac4ba1212457ef29/FLAG29d3fd779 [2020-10-22 00:32:53,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/254bec1e1/f266418196dd4b66ac4ba1212457ef29 [2020-10-22 00:32:53,766 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 00:32:53,773 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 00:32:53,774 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 00:32:53,775 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 00:32:53,778 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 00:32:53,779 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:32:53" (1/1) ... [2020-10-22 00:32:53,783 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745ca6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:53, skipping insertion in model container [2020-10-22 00:32:53,783 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 12:32:53" (1/1) ... [2020-10-22 00:32:53,791 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 00:32:53,837 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 00:32:54,374 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:32:54,393 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 00:32:54,522 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 00:32:54,633 INFO L208 MainTranslator]: Completed translation [2020-10-22 00:32:54,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54 WrapperNode [2020-10-22 00:32:54,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 00:32:54,636 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 00:32:54,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 00:32:54,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 00:32:54,648 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,722 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 00:32:54,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 00:32:54,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 00:32:54,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 00:32:54,733 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,733 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,755 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... [2020-10-22 00:32:54,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 00:32:54,765 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 00:32:54,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 00:32:54,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 00:32:54,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 00:32:54,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 00:32:54,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 00:32:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 00:32:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 00:32:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 00:32:54,849 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 00:32:54,849 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 00:32:54,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 00:32:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 00:32:54,850 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 00:32:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 00:32:54,850 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 00:32:54,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 00:32:54,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 00:32:54,853 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 00:32:56,872 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 00:32:56,872 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 00:32:56,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:32:56 BoogieIcfgContainer [2020-10-22 00:32:56,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 00:32:56,877 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 00:32:56,877 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 00:32:56,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 00:32:56,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 12:32:53" (1/3) ... [2020-10-22 00:32:56,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5251f456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:32:56, skipping insertion in model container [2020-10-22 00:32:56,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 12:32:54" (2/3) ... [2020-10-22 00:32:56,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5251f456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 12:32:56, skipping insertion in model container [2020-10-22 00:32:56,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 12:32:56" (3/3) ... [2020-10-22 00:32:56,885 INFO L111 eAbstractionObserver]: Analyzing ICFG safe005_rmo.opt.i [2020-10-22 00:32:56,899 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 00:32:56,900 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 00:32:56,909 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 00:32:56,911 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 00:32:56,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,945 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,946 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,946 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,946 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,947 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,948 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,949 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,950 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,951 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,952 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,954 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,955 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,956 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,956 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,957 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,958 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,958 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,959 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,960 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,960 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,961 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,961 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,962 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,963 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,964 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,968 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,969 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,969 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,970 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,970 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,979 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,980 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,980 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,981 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,981 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,982 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,983 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,984 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,986 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,986 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,987 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,988 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,988 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,989 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 00:32:56,990 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 00:32:57,006 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 00:32:57,030 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 00:32:57,030 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 00:32:57,030 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 00:32:57,030 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 00:32:57,031 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 00:32:57,031 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 00:32:57,031 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 00:32:57,031 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 00:32:57,048 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 00:32:57,049 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 00:32:57,052 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 108 places, 101 transitions, 217 flow [2020-10-22 00:32:57,054 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 108 places, 101 transitions, 217 flow [2020-10-22 00:32:57,107 INFO L129 PetriNetUnfolder]: 3/98 cut-off events. [2020-10-22 00:32:57,107 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 00:32:57,113 INFO L80 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 98 events. 3/98 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 72 event pairs, 0 based on Foata normal form. 0/93 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2020-10-22 00:32:57,116 INFO L116 LiptonReduction]: Number of co-enabled transitions 1754 [2020-10-22 00:32:57,799 WARN L193 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-22 00:32:59,460 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2020-10-22 00:32:59,690 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-22 00:32:59,862 WARN L193 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-22 00:33:00,244 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-10-22 00:33:00,429 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-22 00:33:00,447 INFO L131 LiptonReduction]: Checked pairs total: 4885 [2020-10-22 00:33:00,447 INFO L133 LiptonReduction]: Total number of compositions: 91 [2020-10-22 00:33:00,454 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2020-10-22 00:33:00,509 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 778 states. [2020-10-22 00:33:00,512 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states. [2020-10-22 00:33:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 00:33:00,519 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:00,520 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 00:33:00,521 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash 961058307, now seen corresponding path program 1 times [2020-10-22 00:33:00,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:00,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662276805] [2020-10-22 00:33:00,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:00,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:00,810 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662276805] [2020-10-22 00:33:00,811 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:00,811 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 00:33:00,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1921806605] [2020-10-22 00:33:00,813 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:00,816 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:00,830 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 00:33:00,831 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:00,836 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:33:00,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 00:33:00,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:00,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 00:33:00,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 00:33:00,856 INFO L87 Difference]: Start difference. First operand 778 states. Second operand 3 states. [2020-10-22 00:33:00,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:00,942 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-10-22 00:33:00,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 00:33:00,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 00:33:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:00,971 INFO L225 Difference]: With dead ends: 650 [2020-10-22 00:33:00,971 INFO L226 Difference]: Without dead ends: 550 [2020-10-22 00:33:00,973 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-10-22 00:33:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2020-10-22 00:33:01,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2020-10-22 00:33:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2020-10-22 00:33:01,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2020-10-22 00:33:01,108 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 5 [2020-10-22 00:33:01,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:01,108 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2020-10-22 00:33:01,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 00:33:01,109 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2020-10-22 00:33:01,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 00:33:01,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:01,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:01,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 00:33:01,112 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:01,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:01,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1422403455, now seen corresponding path program 1 times [2020-10-22 00:33:01,114 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:01,114 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669463069] [2020-10-22 00:33:01,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:01,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:01,290 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669463069] [2020-10-22 00:33:01,290 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:01,290 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:33:01,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2098183704] [2020-10-22 00:33:01,291 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:01,292 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:01,294 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 00:33:01,294 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:01,295 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:33:01,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:33:01,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:01,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:33:01,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:33:01,297 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand 4 states. [2020-10-22 00:33:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:01,337 INFO L93 Difference]: Finished difference Result 570 states and 1684 transitions. [2020-10-22 00:33:01,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:33:01,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 00:33:01,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:01,344 INFO L225 Difference]: With dead ends: 570 [2020-10-22 00:33:01,344 INFO L226 Difference]: Without dead ends: 470 [2020-10-22 00:33:01,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:33:01,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2020-10-22 00:33:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2020-10-22 00:33:01,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2020-10-22 00:33:01,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 1409 transitions. [2020-10-22 00:33:01,414 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 1409 transitions. Word has length 10 [2020-10-22 00:33:01,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:01,415 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 1409 transitions. [2020-10-22 00:33:01,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:33:01,415 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 1409 transitions. [2020-10-22 00:33:01,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 00:33:01,418 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:01,419 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:01,419 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 00:33:01,419 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:01,420 INFO L82 PathProgramCache]: Analyzing trace with hash 2133792037, now seen corresponding path program 1 times [2020-10-22 00:33:01,422 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:01,422 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248135086] [2020-10-22 00:33:01,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:01,542 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248135086] [2020-10-22 00:33:01,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:01,543 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 00:33:01,543 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1848683000] [2020-10-22 00:33:01,543 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:01,545 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:01,547 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 20 transitions. [2020-10-22 00:33:01,547 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:01,599 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:33:01,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:33:01,600 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:33:01,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:33:01,600 INFO L87 Difference]: Start difference. First operand 470 states and 1409 transitions. Second operand 4 states. [2020-10-22 00:33:01,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:01,640 INFO L93 Difference]: Finished difference Result 518 states and 1504 transitions. [2020-10-22 00:33:01,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:33:01,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-22 00:33:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:01,646 INFO L225 Difference]: With dead ends: 518 [2020-10-22 00:33:01,646 INFO L226 Difference]: Without dead ends: 458 [2020-10-22 00:33:01,647 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:33:01,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-10-22 00:33:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-10-22 00:33:01,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-22 00:33:01,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1365 transitions. [2020-10-22 00:33:01,666 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1365 transitions. Word has length 12 [2020-10-22 00:33:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:01,666 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1365 transitions. [2020-10-22 00:33:01,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:33:01,667 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1365 transitions. [2020-10-22 00:33:01,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:33:01,670 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:01,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:01,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 00:33:01,671 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash -612272243, now seen corresponding path program 1 times [2020-10-22 00:33:01,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:01,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067772027] [2020-10-22 00:33:01,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:01,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:01,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067772027] [2020-10-22 00:33:01,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:01,840 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:33:01,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [805968301] [2020-10-22 00:33:01,840 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:01,842 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:01,846 INFO L252 McrAutomatonBuilder]: Finished intersection with 24 states and 33 transitions. [2020-10-22 00:33:01,846 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:01,939 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:33:01,940 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:33:01,940 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:01,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:33:01,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:33:01,941 INFO L87 Difference]: Start difference. First operand 458 states and 1365 transitions. Second operand 5 states. [2020-10-22 00:33:02,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:02,025 INFO L93 Difference]: Finished difference Result 953 states and 2763 transitions. [2020-10-22 00:33:02,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:33:02,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:33:02,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:02,032 INFO L225 Difference]: With dead ends: 953 [2020-10-22 00:33:02,032 INFO L226 Difference]: Without dead ends: 593 [2020-10-22 00:33:02,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:33:02,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2020-10-22 00:33:02,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 458. [2020-10-22 00:33:02,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-10-22 00:33:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1323 transitions. [2020-10-22 00:33:02,061 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1323 transitions. Word has length 13 [2020-10-22 00:33:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:02,062 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1323 transitions. [2020-10-22 00:33:02,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:33:02,062 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1323 transitions. [2020-10-22 00:33:02,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-22 00:33:02,065 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:02,065 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:02,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 00:33:02,065 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:02,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:02,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1697172441, now seen corresponding path program 2 times [2020-10-22 00:33:02,067 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:02,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274875749] [2020-10-22 00:33:02,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:02,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:02,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274875749] [2020-10-22 00:33:02,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:02,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:33:02,166 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [584200642] [2020-10-22 00:33:02,166 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:02,169 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:02,173 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 25 transitions. [2020-10-22 00:33:02,174 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:02,272 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:33:02,273 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:33:02,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:02,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:33:02,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:33:02,274 INFO L87 Difference]: Start difference. First operand 458 states and 1323 transitions. Second operand 5 states. [2020-10-22 00:33:02,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:02,333 INFO L93 Difference]: Finished difference Result 584 states and 1671 transitions. [2020-10-22 00:33:02,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:33:02,334 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-10-22 00:33:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:02,337 INFO L225 Difference]: With dead ends: 584 [2020-10-22 00:33:02,337 INFO L226 Difference]: Without dead ends: 350 [2020-10-22 00:33:02,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:33:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-10-22 00:33:02,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2020-10-22 00:33:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2020-10-22 00:33:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 975 transitions. [2020-10-22 00:33:02,356 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 975 transitions. Word has length 13 [2020-10-22 00:33:02,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:02,356 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 975 transitions. [2020-10-22 00:33:02,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:33:02,357 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 975 transitions. [2020-10-22 00:33:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:33:02,359 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:02,359 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:02,359 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 00:33:02,360 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:02,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:02,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1124631929, now seen corresponding path program 1 times [2020-10-22 00:33:02,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:02,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494604571] [2020-10-22 00:33:02,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:02,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:02,459 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494604571] [2020-10-22 00:33:02,459 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:02,459 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:33:02,460 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [579616410] [2020-10-22 00:33:02,460 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:02,463 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:02,470 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 37 transitions. [2020-10-22 00:33:02,471 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:02,606 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:33:02,607 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 00:33:02,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:02,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 00:33:02,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:33:02,608 INFO L87 Difference]: Start difference. First operand 350 states and 975 transitions. Second operand 5 states. [2020-10-22 00:33:02,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:02,652 INFO L93 Difference]: Finished difference Result 548 states and 1527 transitions. [2020-10-22 00:33:02,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:33:02,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-22 00:33:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:02,656 INFO L225 Difference]: With dead ends: 548 [2020-10-22 00:33:02,656 INFO L226 Difference]: Without dead ends: 344 [2020-10-22 00:33:02,657 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:33:02,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2020-10-22 00:33:02,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2020-10-22 00:33:02,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2020-10-22 00:33:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 953 transitions. [2020-10-22 00:33:02,668 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 953 transitions. Word has length 14 [2020-10-22 00:33:02,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:02,669 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 953 transitions. [2020-10-22 00:33:02,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 00:33:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 953 transitions. [2020-10-22 00:33:02,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-22 00:33:02,670 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:02,670 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:02,671 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 00:33:02,671 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:02,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:02,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1510861615, now seen corresponding path program 2 times [2020-10-22 00:33:02,672 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:02,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510155050] [2020-10-22 00:33:02,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:02,742 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510155050] [2020-10-22 00:33:02,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:02,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:33:02,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1761368182] [2020-10-22 00:33:02,743 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:02,748 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:02,754 INFO L252 McrAutomatonBuilder]: Finished intersection with 26 states and 36 transitions. [2020-10-22 00:33:02,754 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:02,844 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:33:02,844 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:33:02,845 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:02,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:33:02,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:33:02,847 INFO L87 Difference]: Start difference. First operand 344 states and 953 transitions. Second operand 4 states. [2020-10-22 00:33:02,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:02,882 INFO L93 Difference]: Finished difference Result 470 states and 1274 transitions. [2020-10-22 00:33:02,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:33:02,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-22 00:33:02,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:02,885 INFO L225 Difference]: With dead ends: 470 [2020-10-22 00:33:02,885 INFO L226 Difference]: Without dead ends: 200 [2020-10-22 00:33:02,886 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:33:02,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2020-10-22 00:33:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2020-10-22 00:33:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2020-10-22 00:33:02,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 533 transitions. [2020-10-22 00:33:02,894 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 533 transitions. Word has length 14 [2020-10-22 00:33:02,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:02,894 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 533 transitions. [2020-10-22 00:33:02,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:33:02,895 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 533 transitions. [2020-10-22 00:33:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 00:33:02,896 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:02,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:02,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 00:33:02,896 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:02,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:02,897 INFO L82 PathProgramCache]: Analyzing trace with hash 382058925, now seen corresponding path program 1 times [2020-10-22 00:33:02,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:02,899 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221000782] [2020-10-22 00:33:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:02,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:03,022 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221000782] [2020-10-22 00:33:03,022 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:03,022 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 00:33:03,023 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [922612812] [2020-10-22 00:33:03,023 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:03,025 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:03,034 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 65 transitions. [2020-10-22 00:33:03,034 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:03,237 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 00:33:03,238 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 00:33:03,238 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 00:33:03,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 00:33:03,239 INFO L87 Difference]: Start difference. First operand 200 states and 533 transitions. Second operand 4 states. [2020-10-22 00:33:03,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:03,268 INFO L93 Difference]: Finished difference Result 192 states and 446 transitions. [2020-10-22 00:33:03,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 00:33:03,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-22 00:33:03,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:03,271 INFO L225 Difference]: With dead ends: 192 [2020-10-22 00:33:03,271 INFO L226 Difference]: Without dead ends: 148 [2020-10-22 00:33:03,271 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 00:33:03,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2020-10-22 00:33:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2020-10-22 00:33:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2020-10-22 00:33:03,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 341 transitions. [2020-10-22 00:33:03,277 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 341 transitions. Word has length 15 [2020-10-22 00:33:03,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:03,277 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 341 transitions. [2020-10-22 00:33:03,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 00:33:03,278 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 341 transitions. [2020-10-22 00:33:03,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-22 00:33:03,278 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:03,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:03,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 00:33:03,279 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:03,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:03,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1134931214, now seen corresponding path program 1 times [2020-10-22 00:33:03,281 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:03,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592882809] [2020-10-22 00:33:03,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:03,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:03,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592882809] [2020-10-22 00:33:03,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:03,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 00:33:03,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1556395307] [2020-10-22 00:33:03,372 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:03,374 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:03,387 INFO L252 McrAutomatonBuilder]: Finished intersection with 46 states and 74 transitions. [2020-10-22 00:33:03,387 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:03,818 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12170#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:33:03,819 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 00:33:03,819 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:03,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 00:33:03,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 00:33:03,820 INFO L87 Difference]: Start difference. First operand 148 states and 341 transitions. Second operand 6 states. [2020-10-22 00:33:03,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:03,865 INFO L93 Difference]: Finished difference Result 114 states and 224 transitions. [2020-10-22 00:33:03,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 00:33:03,865 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-22 00:33:03,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:03,866 INFO L225 Difference]: With dead ends: 114 [2020-10-22 00:33:03,866 INFO L226 Difference]: Without dead ends: 88 [2020-10-22 00:33:03,867 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:33:03,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-22 00:33:03,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2020-10-22 00:33:03,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2020-10-22 00:33:03,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 165 transitions. [2020-10-22 00:33:03,871 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 165 transitions. Word has length 17 [2020-10-22 00:33:03,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:03,871 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 165 transitions. [2020-10-22 00:33:03,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 00:33:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 165 transitions. [2020-10-22 00:33:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 00:33:03,872 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:03,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:03,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 00:33:03,872 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:03,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:03,873 INFO L82 PathProgramCache]: Analyzing trace with hash -280439418, now seen corresponding path program 1 times [2020-10-22 00:33:03,877 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:03,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065392039] [2020-10-22 00:33:03,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:03,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065392039] [2020-10-22 00:33:03,980 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:03,980 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 00:33:03,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1579809320] [2020-10-22 00:33:03,980 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:03,983 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:03,995 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 77 transitions. [2020-10-22 00:33:03,996 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:04,421 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [12469#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 00:33:04,421 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 00:33:04,421 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:04,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 00:33:04,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 00:33:04,422 INFO L87 Difference]: Start difference. First operand 88 states and 165 transitions. Second operand 7 states. [2020-10-22 00:33:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:04,485 INFO L93 Difference]: Finished difference Result 70 states and 127 transitions. [2020-10-22 00:33:04,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-22 00:33:04,485 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 00:33:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:04,486 INFO L225 Difference]: With dead ends: 70 [2020-10-22 00:33:04,486 INFO L226 Difference]: Without dead ends: 62 [2020-10-22 00:33:04,487 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-22 00:33:04,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-10-22 00:33:04,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2020-10-22 00:33:04,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-10-22 00:33:04,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 113 transitions. [2020-10-22 00:33:04,490 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 113 transitions. Word has length 19 [2020-10-22 00:33:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:04,492 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 113 transitions. [2020-10-22 00:33:04,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 00:33:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 113 transitions. [2020-10-22 00:33:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:33:04,493 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:04,493 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:04,493 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 00:33:04,494 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:04,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash 971885777, now seen corresponding path program 1 times [2020-10-22 00:33:04,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:04,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861097625] [2020-10-22 00:33:04,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 00:33:04,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 00:33:04,930 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861097625] [2020-10-22 00:33:04,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 00:33:04,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-22 00:33:04,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2041417475] [2020-10-22 00:33:04,931 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 00:33:04,935 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 00:33:04,957 INFO L252 McrAutomatonBuilder]: Finished intersection with 48 states and 75 transitions. [2020-10-22 00:33:04,957 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 00:33:04,999 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,002 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,012 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:33:05,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,015 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:05,016 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,017 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 00:33:05,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,018 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,023 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,041 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:05,042 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:05,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,048 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,057 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,062 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,100 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:05,103 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,117 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,132 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,157 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:05,166 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:05,167 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:05,170 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,171 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:33:05,172 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,195 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,199 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,199 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,204 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,212 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:05,213 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,214 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,217 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,230 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,231 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:33:05,232 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,245 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,259 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,269 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,273 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,277 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,286 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 00:33:05,286 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,493 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 30 [2020-10-22 00:33:05,744 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 93 [2020-10-22 00:33:05,762 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,763 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,773 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:33:05,774 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,777 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:05,777 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,779 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,780 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:05,781 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 00:33:05,781 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:05,782 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,789 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,790 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:33:05,791 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,807 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,810 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,812 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,817 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:05,818 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,819 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,841 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 3 conjuncts [2020-10-22 00:33:05,842 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:05,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,843 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,846 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,855 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,861 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,862 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:33:05,863 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,876 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,882 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,886 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:05,887 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,894 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:05,895 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,898 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,903 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,909 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:05,915 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,920 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:05,922 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 00:33:05,923 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:05,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:05,941 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 3, 4, 2, 3, 2, 1] term [2020-10-22 00:33:05,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,408 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 105 [2020-10-22 00:33:06,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,425 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,434 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:33:06,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,436 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:06,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,437 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:06,438 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:06,465 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:06,467 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:06,474 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:06,475 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:06,480 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:06,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:06,495 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:06,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:06,520 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,527 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,534 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,541 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:06,542 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:06,547 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:06,548 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:06,558 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:06,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:06,591 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:06,597 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:06,737 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 26 [2020-10-22 00:33:07,155 WARN L193 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 134 [2020-10-22 00:33:07,172 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 00:33:07,174 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,175 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,178 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:33:07,179 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,181 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:07,181 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,183 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:07,183 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,184 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,185 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 00:33:07,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,186 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:07,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,194 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,196 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:07,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,205 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:07,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,222 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,228 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,231 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,237 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,240 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,247 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,248 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:07,249 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:07,255 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,256 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,263 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,274 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:07,277 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,290 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,294 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,297 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,304 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 00:33:07,305 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,306 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:07,312 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,322 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,336 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,340 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,344 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,355 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,356 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:07,365 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:07,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,372 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:07,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,613 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 00:33:07,613 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,615 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:07,615 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,618 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,635 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:07,653 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:07,659 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,661 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,663 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,674 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,682 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:07,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:07,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,691 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,693 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:07,704 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:07,711 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 2, 4, 4, 3, 2, 1] term [2020-10-22 00:33:07,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,152 WARN L193 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 31 [2020-10-22 00:33:08,570 WARN L193 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 103 [2020-10-22 00:33:08,578 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 00:33:08,580 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,581 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,583 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:08,584 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,585 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:08,585 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,587 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-10-22 00:33:08,587 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,588 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 00:33:08,589 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,589 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:08,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,595 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,596 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:08,600 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:33:08,603 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,610 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:08,616 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,621 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:08,622 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:08,623 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,631 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,634 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:33:08,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:08,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,649 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,650 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:08,655 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,658 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,673 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,677 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,678 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:08,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:08,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,690 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:08,700 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,703 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,712 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:08,723 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,726 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,733 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:08,735 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:08,736 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:08,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:08,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:08,764 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,767 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:08,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,038 WARN L193 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 102 [2020-10-22 00:33:09,049 INFO L603 QuantifierPusher]: Distributing 7 disjuncts over 2 conjuncts [2020-10-22 00:33:09,050 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,051 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,061 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:09,061 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,063 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 00:33:09,063 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,064 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 3, 3, 2, 2, 1] term [2020-10-22 00:33:09,065 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,067 INFO L603 QuantifierPusher]: Distributing 8 disjuncts over 2 conjuncts [2020-10-22 00:33:09,068 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,068 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:09,073 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,077 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,078 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:09,091 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:33:09,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,100 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:09,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:09,110 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:09,111 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,121 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 00:33:09,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:09,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,136 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,137 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 00:33:09,142 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,145 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,214 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,218 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,219 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,219 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:09,223 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:09,224 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:09,238 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,241 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,244 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,249 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,250 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 00:33:09,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,261 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,269 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 00:33:09,272 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 00:33:09,273 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 00:33:09,279 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:09,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,291 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 00:33:09,313 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,316 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,320 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 00:33:09,327 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 3 new interpolants: [12674#(and (or (= (mod ~x$r_buff0_thd3~0 256) 0) (and (or (= ~x$w_buff0~0 1) (= (mod ~x$w_buff0_used~0 256) 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0))) (or (and (= ~x~0 1) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (= (mod ~x$r_buff1_thd3~0 256) 0)) (and (not (= (mod ~x$r_buff0_thd3~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))))), 12675#(and (= ~x$w_buff0~0 1) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (or (and (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0))) (and (not (= (mod ~x$r_buff0_thd3~0 256) 0)) (not (= (mod ~x$w_buff0_used~0 256) 0)))) (or (= (mod ~x$r_buff0_thd2~0 256) 0) (= (mod ~x$r_buff1_thd3~0 256) 0))), 12676#(and (<= ~x$r_buff1_thd3~0 (* 256 (div ~x$r_buff1_thd3~0 256))) (= ~x$w_buff0~0 1) (<= 0 ~x$r_buff0_thd3~0) (not (= (mod ~x$r_buff0_thd2~0 256) 0)) (= 0 ~x$r_buff0_thd1~0) (= ~x$r_buff1_thd1~0 0) (< 0 (+ (div ~x$r_buff1_thd3~0 256) 1)) (<= ~x$r_buff0_thd3~0 (* 256 (div ~x$r_buff0_thd3~0 256))) (not (= (mod ~x$w_buff0_used~0 256) 0)))] [2020-10-22 00:33:09,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-22 00:33:09,328 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 00:33:09,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-22 00:33:09,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2020-10-22 00:33:09,329 INFO L87 Difference]: Start difference. First operand 62 states and 113 transitions. Second operand 11 states. [2020-10-22 00:33:09,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 00:33:09,742 INFO L93 Difference]: Finished difference Result 77 states and 136 transitions. [2020-10-22 00:33:09,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-22 00:33:09,743 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-22 00:33:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 00:33:09,744 INFO L225 Difference]: With dead ends: 77 [2020-10-22 00:33:09,744 INFO L226 Difference]: Without dead ends: 42 [2020-10-22 00:33:09,745 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2020-10-22 00:33:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-22 00:33:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2020-10-22 00:33:09,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-22 00:33:09,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 65 transitions. [2020-10-22 00:33:09,748 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 65 transitions. Word has length 21 [2020-10-22 00:33:09,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 00:33:09,749 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 65 transitions. [2020-10-22 00:33:09,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-22 00:33:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 65 transitions. [2020-10-22 00:33:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-22 00:33:09,750 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 00:33:09,750 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 00:33:09,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-22 00:33:09,750 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 00:33:09,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 00:33:09,751 INFO L82 PathProgramCache]: Analyzing trace with hash -784334831, now seen corresponding path program 2 times [2020-10-22 00:33:09,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 00:33:09,753 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134847287] [2020-10-22 00:33:09,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 00:33:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:33:09,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:33:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 00:33:09,929 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 00:33:10,008 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 00:33:10,009 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 00:33:10,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-22 00:33:10,066 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,067 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,067 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,067 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [773] [2020-10-22 00:33:10,068 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,068 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,069 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,069 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,070 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,070 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,070 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,071 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,071 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,071 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,072 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,072 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,073 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,073 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,074 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,074 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,078 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,079 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,079 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,080 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,080 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,083 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,084 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,084 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,084 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,085 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,085 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,086 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,086 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,086 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 00:33:10,087 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 00:33:10,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 12:33:10 BasicIcfg [2020-10-22 00:33:10,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 00:33:10,220 INFO L168 Benchmark]: Toolchain (without parser) took 16452.14 ms. Allocated memory was 145.2 MB in the beginning and 404.2 MB in the end (delta: 259.0 MB). Free memory was 100.8 MB in the beginning and 251.5 MB in the end (delta: -150.7 MB). Peak memory consumption was 108.3 MB. Max. memory is 7.1 GB. [2020-10-22 00:33:10,224 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 00:33:10,225 INFO L168 Benchmark]: CACSL2BoogieTranslator took 861.08 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 154.2 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2020-10-22 00:33:10,225 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.73 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 00:33:10,230 INFO L168 Benchmark]: Boogie Preprocessor took 42.12 ms. Allocated memory is still 203.4 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:33:10,232 INFO L168 Benchmark]: RCFGBuilder took 2109.94 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 149.4 MB in the beginning and 183.7 MB in the end (delta: -34.3 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2020-10-22 00:33:10,233 INFO L168 Benchmark]: TraceAbstraction took 13341.42 ms. Allocated memory was 247.5 MB in the beginning and 404.2 MB in the end (delta: 156.8 MB). Free memory was 183.7 MB in the beginning and 251.5 MB in the end (delta: -67.9 MB). Peak memory consumption was 88.9 MB. Max. memory is 7.1 GB. [2020-10-22 00:33:10,243 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.20 ms. Allocated memory is still 145.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 861.08 ms. Allocated memory was 145.2 MB in the beginning and 203.4 MB in the end (delta: 58.2 MB). Free memory was 100.0 MB in the beginning and 154.2 MB in the end (delta: -54.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 86.73 ms. Allocated memory is still 203.4 MB. Free memory was 154.2 MB in the beginning and 151.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.12 ms. Allocated memory is still 203.4 MB. Free memory was 151.4 MB in the beginning and 149.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2109.94 ms. Allocated memory was 203.4 MB in the beginning and 247.5 MB in the end (delta: 44.0 MB). Free memory was 149.4 MB in the beginning and 183.7 MB in the end (delta: -34.3 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13341.42 ms. Allocated memory was 247.5 MB in the beginning and 404.2 MB in the end (delta: 156.8 MB). Free memory was 183.7 MB in the beginning and 251.5 MB in the end (delta: -67.9 MB). Peak memory consumption was 88.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 933 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 77 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.3s, 108 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 27 TransitionsAfterwards, 1754 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 91 TotalNumberOfCompositions, 4885 MoverChecksTotal - CounterExampleResult [Line: 18]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_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 t1912; [L832] FCALL, FORK 0 pthread_create(&t1912, ((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 t1913; [L834] FCALL, FORK 0 pthread_create(&t1913, ((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] [L835] 0 pthread_t t1914; [L836] FCALL, FORK 0 pthread_create(&t1914, ((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=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 TRUE 2 !expression [L18] COND FALSE 2 !(0) [L18] 2 __assert_fail ("0", "safe005_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) [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}, 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] [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 [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] [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] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 [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] 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] 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] 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] 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] 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 [__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=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] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [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; [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [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) 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] [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe005_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) 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, 99 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 309 SDtfs, 311 SDslu, 566 SDs, 0 SdLazy, 229 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=778occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 135 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 11394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...