/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/safe029_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-06 01:10:30,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-06 01:10:30,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-06 01:10:30,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-06 01:10:30,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-06 01:10:30,693 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-06 01:10:30,694 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-06 01:10:30,696 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-06 01:10:30,698 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-06 01:10:30,698 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-06 01:10:30,699 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-06 01:10:30,700 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-06 01:10:30,701 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-06 01:10:30,702 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-06 01:10:30,703 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-06 01:10:30,704 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-06 01:10:30,705 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-06 01:10:30,706 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-06 01:10:30,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-06 01:10:30,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-06 01:10:30,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-06 01:10:30,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-06 01:10:30,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-06 01:10:30,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-06 01:10:30,716 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-06 01:10:30,717 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-06 01:10:30,717 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-06 01:10:30,718 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-06 01:10:30,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-06 01:10:30,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-06 01:10:30,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-06 01:10:30,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-06 01:10:30,723 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-06 01:10:30,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-06 01:10:30,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-06 01:10:30,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-06 01:10:30,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-06 01:10:30,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-06 01:10:30,731 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-06 01:10:30,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-06 01:10:30,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-06 01:10:30,738 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-06 01:10:30,783 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-06 01:10:30,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-06 01:10:30,784 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-06 01:10:30,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-06 01:10:30,785 INFO L138 SettingsManager]: * Use SBE=true [2020-10-06 01:10:30,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-06 01:10:30,786 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-06 01:10:30,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-06 01:10:30,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-06 01:10:30,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-06 01:10:30,787 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-06 01:10:30,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-06 01:10:30,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-06 01:10:30,788 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-06 01:10:30,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-06 01:10:30,789 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-06 01:10:30,789 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-06 01:10:30,789 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-06 01:10:30,789 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-06 01:10:30,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-06 01:10:30,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-06 01:10:30,790 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-06 01:10:30,790 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-06 01:10:30,790 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-06 01:10:30,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-06 01:10:30,791 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-06 01:10:30,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-06 01:10:30,791 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-06 01:10:30,791 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-06 01:10:30,791 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-06 01:10:30,792 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-06 01:10:31,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-06 01:10:31,126 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-06 01:10:31,130 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-06 01:10:31,132 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-06 01:10:31,132 INFO L275 PluginConnector]: CDTParser initialized [2020-10-06 01:10:31,133 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2020-10-06 01:10:31,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d429ae183/1331d9c86a64466f8d022072c071da90/FLAG4ae8d97da [2020-10-06 01:10:31,737 INFO L306 CDTParser]: Found 1 translation units. [2020-10-06 01:10:31,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.oepc.i [2020-10-06 01:10:31,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d429ae183/1331d9c86a64466f8d022072c071da90/FLAG4ae8d97da [2020-10-06 01:10:32,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d429ae183/1331d9c86a64466f8d022072c071da90 [2020-10-06 01:10:32,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-06 01:10:32,087 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-06 01:10:32,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-06 01:10:32,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-06 01:10:32,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-06 01:10:32,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,096 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c056663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32, skipping insertion in model container [2020-10-06 01:10:32,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-06 01:10:32,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-06 01:10:32,641 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:10:32,670 INFO L203 MainTranslator]: Completed pre-run [2020-10-06 01:10:32,737 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-06 01:10:32,812 INFO L208 MainTranslator]: Completed translation [2020-10-06 01:10:32,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32 WrapperNode [2020-10-06 01:10:32,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-06 01:10:32,813 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-06 01:10:32,813 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-06 01:10:32,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-06 01:10:32,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,846 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-06 01:10:32,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-06 01:10:32,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-06 01:10:32,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-06 01:10:32,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,918 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,921 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (1/1) ... [2020-10-06 01:10:32,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-06 01:10:32,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-06 01:10:32,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-06 01:10:32,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-06 01:10:32,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (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-06 01:10:32,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-06 01:10:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-06 01:10:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-06 01:10:32,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-06 01:10:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-06 01:10:32,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-06 01:10:32,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-06 01:10:32,997 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-06 01:10:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-06 01:10:32,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-06 01:10:32,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-06 01:10:32,999 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-06 01:10:35,075 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-06 01:10:35,076 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-06 01:10:35,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:10:35 BoogieIcfgContainer [2020-10-06 01:10:35,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-06 01:10:35,080 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-06 01:10:35,080 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-06 01:10:35,083 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-06 01:10:35,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.10 01:10:32" (1/3) ... [2020-10-06 01:10:35,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5574ed29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:10:35, skipping insertion in model container [2020-10-06 01:10:35,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.10 01:10:32" (2/3) ... [2020-10-06 01:10:35,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5574ed29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.10 01:10:35, skipping insertion in model container [2020-10-06 01:10:35,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.10 01:10:35" (3/3) ... [2020-10-06 01:10:35,087 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.oepc.i [2020-10-06 01:10:35,098 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-06 01:10:35,099 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-06 01:10:35,107 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-06 01:10:35,108 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-06 01:10:35,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,135 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,135 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,136 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,136 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,136 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,137 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,137 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,138 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,139 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,140 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,140 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,141 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,142 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,143 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,147 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,148 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,149 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,149 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,149 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,150 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,153 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,153 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,153 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,154 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,155 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-06 01:10:35,170 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-06 01:10:35,192 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-06 01:10:35,193 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-06 01:10:35,193 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-06 01:10:35,193 INFO L378 AbstractCegarLoop]: Backedges is MCR [2020-10-06 01:10:35,193 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-06 01:10:35,193 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-06 01:10:35,193 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-06 01:10:35,194 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-06 01:10:35,210 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 79 places, 74 transitions, 158 flow [2020-10-06 01:10:35,212 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-06 01:10:35,253 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-06 01:10:35,254 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:10:35,259 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-06 01:10:35,262 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 79 places, 74 transitions, 158 flow [2020-10-06 01:10:35,281 INFO L129 PetriNetUnfolder]: 2/72 cut-off events. [2020-10-06 01:10:35,282 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-06 01:10:35,282 INFO L80 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 72 events. 2/72 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 44 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 45. Up to 2 conditions per place. [2020-10-06 01:10:35,284 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 896 [2020-10-06 01:10:35,286 INFO L182 etLargeBlockEncoding]: Variable Check. [2020-10-06 01:10:36,051 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-06 01:10:36,188 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-10-06 01:10:37,357 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 224 DAG size of output: 184 [2020-10-06 01:10:37,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-06 01:10:37,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:10:37,403 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-06 01:10:37,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-06 01:10:38,228 WARN L193 SmtUtils]: Spent 818.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 119 [2020-10-06 01:10:39,181 WARN L193 SmtUtils]: Spent 368.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-06 01:10:39,534 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-06 01:10:40,494 WARN L193 SmtUtils]: Spent 957.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 120 [2020-10-06 01:10:40,797 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2020-10-06 01:10:41,422 WARN L193 SmtUtils]: Spent 623.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 104 [2020-10-06 01:10:41,732 WARN L193 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-06 01:10:42,173 WARN L193 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2020-10-06 01:10:42,480 WARN L193 SmtUtils]: Spent 303.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-10-06 01:10:42,846 WARN L193 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 77 [2020-10-06 01:10:42,950 INFO L206 etLargeBlockEncoding]: Checked pairs total: 2157 [2020-10-06 01:10:42,950 INFO L214 etLargeBlockEncoding]: Total number of compositions: 64 [2020-10-06 01:10:42,954 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-06 01:10:42,971 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 164 states. [2020-10-06 01:10:42,974 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states. [2020-10-06 01:10:42,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-10-06 01:10:42,980 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:42,981 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-10-06 01:10:42,981 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:42,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash 895506, now seen corresponding path program 1 times [2020-10-06 01:10:43,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:43,021 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192488789] [2020-10-06 01:10:43,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:43,263 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-06 01:10:43,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192488789] [2020-10-06 01:10:43,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:43,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:10:43,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [545277194] [2020-10-06 01:10:43,270 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:43,274 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:43,287 INFO L258 McrAutomatonBuilder]: Finished intersection with 4 states and 3 transitions. [2020-10-06 01:10:43,287 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:43,294 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:10:43,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:10:43,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:43,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:10:43,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:10:43,308 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 3 states. [2020-10-06 01:10:43,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:43,369 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-06 01:10:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:10:43,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-10-06 01:10:43,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:43,381 INFO L225 Difference]: With dead ends: 137 [2020-10-06 01:10:43,381 INFO L226 Difference]: Without dead ends: 112 [2020-10-06 01:10:43,382 INFO L675 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-06 01:10:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-06 01:10:43,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-06 01:10:43,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-06 01:10:43,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-06 01:10:43,432 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 3 [2020-10-06 01:10:43,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:43,433 INFO L479 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-06 01:10:43,433 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:10:43,433 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-06 01:10:43,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-06 01:10:43,434 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:43,434 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:43,435 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-06 01:10:43,435 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:43,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:43,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1857466431, now seen corresponding path program 1 times [2020-10-06 01:10:43,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:43,444 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827112546] [2020-10-06 01:10:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:43,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:43,543 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-06 01:10:43,544 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827112546] [2020-10-06 01:10:43,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:43,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:10:43,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [114512148] [2020-10-06 01:10:43,545 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:43,546 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:43,548 INFO L258 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-06 01:10:43,548 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:43,549 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:10:43,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:10:43,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:43,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:10:43,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:10:43,551 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 3 states. [2020-10-06 01:10:43,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:43,580 INFO L93 Difference]: Finished difference Result 111 states and 252 transitions. [2020-10-06 01:10:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:10:43,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-06 01:10:43,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:43,583 INFO L225 Difference]: With dead ends: 111 [2020-10-06 01:10:43,583 INFO L226 Difference]: Without dead ends: 111 [2020-10-06 01:10:43,584 INFO L675 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-06 01:10:43,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2020-10-06 01:10:43,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2020-10-06 01:10:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2020-10-06 01:10:43,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 252 transitions. [2020-10-06 01:10:43,598 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 252 transitions. Word has length 7 [2020-10-06 01:10:43,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:43,598 INFO L479 AbstractCegarLoop]: Abstraction has 111 states and 252 transitions. [2020-10-06 01:10:43,598 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:10:43,599 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 252 transitions. [2020-10-06 01:10:43,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 01:10:43,599 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:43,600 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:43,600 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-06 01:10:43,600 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:43,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:43,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1750629419, now seen corresponding path program 1 times [2020-10-06 01:10:43,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:43,602 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133529485] [2020-10-06 01:10:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:43,683 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-06 01:10:43,683 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133529485] [2020-10-06 01:10:43,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:43,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-06 01:10:43,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [700478383] [2020-10-06 01:10:43,684 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:43,685 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:43,688 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 14 transitions. [2020-10-06 01:10:43,688 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:43,741 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:10:43,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:10:43,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:43,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:10:43,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:10:43,742 INFO L87 Difference]: Start difference. First operand 111 states and 252 transitions. Second operand 3 states. [2020-10-06 01:10:43,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:43,753 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-06 01:10:43,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:10:43,754 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2020-10-06 01:10:43,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:43,756 INFO L225 Difference]: With dead ends: 110 [2020-10-06 01:10:43,756 INFO L226 Difference]: Without dead ends: 110 [2020-10-06 01:10:43,756 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:10:43,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-06 01:10:43,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-06 01:10:43,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-06 01:10:43,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-06 01:10:43,768 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 8 [2020-10-06 01:10:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:43,768 INFO L479 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-06 01:10:43,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:10:43,769 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-06 01:10:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-06 01:10:43,770 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:43,770 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:43,770 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-06 01:10:43,770 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:43,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:43,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1746918336, now seen corresponding path program 1 times [2020-10-06 01:10:43,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:43,773 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760262027] [2020-10-06 01:10:43,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:43,884 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-06 01:10:43,885 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760262027] [2020-10-06 01:10:43,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:43,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:10:43,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [513072270] [2020-10-06 01:10:43,886 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:43,887 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:43,888 INFO L258 McrAutomatonBuilder]: Finished intersection with 11 states and 12 transitions. [2020-10-06 01:10:43,889 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:43,895 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:10:43,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-06 01:10:43,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:43,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-06 01:10:43,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:10:43,897 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 4 states. [2020-10-06 01:10:43,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:43,941 INFO L93 Difference]: Finished difference Result 109 states and 246 transitions. [2020-10-06 01:10:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:10:43,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-10-06 01:10:43,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:43,943 INFO L225 Difference]: With dead ends: 109 [2020-10-06 01:10:43,944 INFO L226 Difference]: Without dead ends: 109 [2020-10-06 01:10:43,944 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-06 01:10:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2020-10-06 01:10:43,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2020-10-06 01:10:43,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2020-10-06 01:10:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 246 transitions. [2020-10-06 01:10:43,954 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 246 transitions. Word has length 8 [2020-10-06 01:10:43,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:43,954 INFO L479 AbstractCegarLoop]: Abstraction has 109 states and 246 transitions. [2020-10-06 01:10:43,954 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-06 01:10:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 246 transitions. [2020-10-06 01:10:43,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:10:43,956 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:43,956 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:43,956 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-06 01:10:43,956 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:43,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:43,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1273980600, now seen corresponding path program 1 times [2020-10-06 01:10:43,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:43,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742530840] [2020-10-06 01:10:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:43,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:44,024 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-06 01:10:44,024 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742530840] [2020-10-06 01:10:44,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:44,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-06 01:10:44,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1174936923] [2020-10-06 01:10:44,025 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:44,027 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:44,030 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 23 transitions. [2020-10-06 01:10:44,030 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:44,031 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:10:44,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-06 01:10:44,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:44,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-06 01:10:44,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-06 01:10:44,033 INFO L87 Difference]: Start difference. First operand 109 states and 246 transitions. Second operand 3 states. [2020-10-06 01:10:44,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:44,058 INFO L93 Difference]: Finished difference Result 154 states and 330 transitions. [2020-10-06 01:10:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:10:44,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-06 01:10:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:44,060 INFO L225 Difference]: With dead ends: 154 [2020-10-06 01:10:44,061 INFO L226 Difference]: Without dead ends: 118 [2020-10-06 01:10:44,061 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-06 01:10:44,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2020-10-06 01:10:44,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 106. [2020-10-06 01:10:44,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-06 01:10:44,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 226 transitions. [2020-10-06 01:10:44,081 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 226 transitions. Word has length 9 [2020-10-06 01:10:44,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:44,082 INFO L479 AbstractCegarLoop]: Abstraction has 106 states and 226 transitions. [2020-10-06 01:10:44,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-06 01:10:44,082 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 226 transitions. [2020-10-06 01:10:44,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:10:44,087 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:44,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:44,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-06 01:10:44,087 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:44,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:44,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1565096682, now seen corresponding path program 1 times [2020-10-06 01:10:44,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:44,092 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701861181] [2020-10-06 01:10:44,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:44,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:44,193 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-06 01:10:44,193 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701861181] [2020-10-06 01:10:44,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:44,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:10:44,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [154375371] [2020-10-06 01:10:44,194 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:44,196 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:44,198 INFO L258 McrAutomatonBuilder]: Finished intersection with 17 states and 24 transitions. [2020-10-06 01:10:44,198 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:44,269 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:10:44,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:10:44,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:44,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:10:44,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:10:44,270 INFO L87 Difference]: Start difference. First operand 106 states and 226 transitions. Second operand 5 states. [2020-10-06 01:10:44,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:44,307 INFO L93 Difference]: Finished difference Result 104 states and 220 transitions. [2020-10-06 01:10:44,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-06 01:10:44,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-06 01:10:44,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:44,309 INFO L225 Difference]: With dead ends: 104 [2020-10-06 01:10:44,309 INFO L226 Difference]: Without dead ends: 104 [2020-10-06 01:10:44,310 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:10:44,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-06 01:10:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2020-10-06 01:10:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-10-06 01:10:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 220 transitions. [2020-10-06 01:10:44,316 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 220 transitions. Word has length 9 [2020-10-06 01:10:44,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:44,316 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 220 transitions. [2020-10-06 01:10:44,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:10:44,316 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 220 transitions. [2020-10-06 01:10:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-06 01:10:44,317 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:44,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:44,318 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-06 01:10:44,318 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:44,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:44,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1680046662, now seen corresponding path program 1 times [2020-10-06 01:10:44,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:44,320 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537845425] [2020-10-06 01:10:44,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:44,491 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-06 01:10:44,497 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537845425] [2020-10-06 01:10:44,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:44,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:10:44,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2101900613] [2020-10-06 01:10:44,498 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:44,499 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:44,500 INFO L258 McrAutomatonBuilder]: Finished intersection with 12 states and 13 transitions. [2020-10-06 01:10:44,500 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:44,517 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:10:44,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:10:44,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:44,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:10:44,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:10:44,518 INFO L87 Difference]: Start difference. First operand 104 states and 220 transitions. Second operand 5 states. [2020-10-06 01:10:44,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:44,637 INFO L93 Difference]: Finished difference Result 102 states and 214 transitions. [2020-10-06 01:10:44,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:10:44,640 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-06 01:10:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:44,643 INFO L225 Difference]: With dead ends: 102 [2020-10-06 01:10:44,643 INFO L226 Difference]: Without dead ends: 102 [2020-10-06 01:10:44,644 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-06 01:10:44,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2020-10-06 01:10:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2020-10-06 01:10:44,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-10-06 01:10:44,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 212 transitions. [2020-10-06 01:10:44,650 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 212 transitions. Word has length 9 [2020-10-06 01:10:44,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:44,651 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 212 transitions. [2020-10-06 01:10:44,651 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:10:44,651 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 212 transitions. [2020-10-06 01:10:44,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-06 01:10:44,653 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:44,654 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:44,654 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-06 01:10:44,654 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:44,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:44,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1273416656, now seen corresponding path program 1 times [2020-10-06 01:10:44,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:44,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736552162] [2020-10-06 01:10:44,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:44,813 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-06 01:10:44,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736552162] [2020-10-06 01:10:44,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:44,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-06 01:10:44,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1762520210] [2020-10-06 01:10:44,815 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:44,816 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:44,820 INFO L258 McrAutomatonBuilder]: Finished intersection with 20 states and 30 transitions. [2020-10-06 01:10:44,820 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:44,919 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [2777#(and (= ~y~0 1) (= ~y$r_buff0_thd0~0 0))] [2020-10-06 01:10:44,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:10:44,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:44,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:10:44,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:10:44,921 INFO L87 Difference]: Start difference. First operand 101 states and 212 transitions. Second operand 7 states. [2020-10-06 01:10:45,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:45,022 INFO L93 Difference]: Finished difference Result 107 states and 222 transitions. [2020-10-06 01:10:45,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-06 01:10:45,023 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-10-06 01:10:45,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:45,024 INFO L225 Difference]: With dead ends: 107 [2020-10-06 01:10:45,025 INFO L226 Difference]: Without dead ends: 107 [2020-10-06 01:10:45,025 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:10:45,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2020-10-06 01:10:45,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2020-10-06 01:10:45,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-06 01:10:45,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 219 transitions. [2020-10-06 01:10:45,031 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 219 transitions. Word has length 10 [2020-10-06 01:10:45,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:45,031 INFO L479 AbstractCegarLoop]: Abstraction has 105 states and 219 transitions. [2020-10-06 01:10:45,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:10:45,032 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 219 transitions. [2020-10-06 01:10:45,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-06 01:10:45,032 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:45,033 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:45,033 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-06 01:10:45,033 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:45,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:45,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1066818889, now seen corresponding path program 1 times [2020-10-06 01:10:45,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:45,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897533517] [2020-10-06 01:10:45,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:45,119 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-06 01:10:45,120 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897533517] [2020-10-06 01:10:45,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:45,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-06 01:10:45,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [161129224] [2020-10-06 01:10:45,120 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:45,122 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:45,127 INFO L258 McrAutomatonBuilder]: Finished intersection with 29 states and 46 transitions. [2020-10-06 01:10:45,127 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:45,159 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,187 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,229 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,253 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,274 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [3099#(not (= 2 ~__unbuffered_cnt~0))] [2020-10-06 01:10:45,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-06 01:10:45,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-06 01:10:45,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-06 01:10:45,276 INFO L87 Difference]: Start difference. First operand 105 states and 219 transitions. Second operand 5 states. [2020-10-06 01:10:45,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:45,326 INFO L93 Difference]: Finished difference Result 69 states and 127 transitions. [2020-10-06 01:10:45,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-06 01:10:45,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-06 01:10:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:45,328 INFO L225 Difference]: With dead ends: 69 [2020-10-06 01:10:45,328 INFO L226 Difference]: Without dead ends: 34 [2020-10-06 01:10:45,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:10:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-06 01:10:45,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2020-10-06 01:10:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-06 01:10:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 47 transitions. [2020-10-06 01:10:45,331 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 47 transitions. Word has length 11 [2020-10-06 01:10:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:45,332 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 47 transitions. [2020-10-06 01:10:45,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-06 01:10:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 47 transitions. [2020-10-06 01:10:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:10:45,333 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:45,333 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:45,333 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-06 01:10:45,333 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:45,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1949389069, now seen corresponding path program 1 times [2020-10-06 01:10:45,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:45,335 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559613377] [2020-10-06 01:10:45,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:45,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-06 01:10:45,512 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-06 01:10:45,512 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559613377] [2020-10-06 01:10:45,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-06 01:10:45,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-06 01:10:45,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1157622320] [2020-10-06 01:10:45,513 INFO L200 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-06 01:10:45,516 INFO L255 McrAutomatonBuilder]: Started intersection. [2020-10-06 01:10:45,522 INFO L258 McrAutomatonBuilder]: Finished intersection with 30 states and 42 transitions. [2020-10-06 01:10:45,522 INFO L282 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-06 01:10:45,544 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 3, 2, 1] term [2020-10-06 01:10:45,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,545 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 4, 3, 2, 1] term [2020-10-06 01:10:45,545 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,548 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:10:45,549 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,552 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-06 01:10:45,552 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,554 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,555 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,565 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,572 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,573 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,579 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,594 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,608 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:10:45,617 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,630 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:45,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:10:45,656 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,668 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,672 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,683 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:10:45,699 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,710 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:45,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,748 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:10:45,760 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,770 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:45,793 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,794 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,799 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,800 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:10:45,801 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-06 01:10:45,802 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,811 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:10:45,817 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:10:45,818 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:45,826 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,829 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,830 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,831 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,835 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,840 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,852 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,853 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,862 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,875 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,876 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:10:45,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,882 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:10:45,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,886 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:10:45,891 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:10:45,893 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:10:45,897 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,902 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,904 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:10:45,907 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,916 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,919 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-06 01:10:45,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:45,957 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:10:45,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,959 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,960 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-06 01:10:45,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,965 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,980 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:45,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,987 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:45,992 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,007 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:10:46,007 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,009 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,013 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,015 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:46,022 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,026 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:46,032 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,091 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-06 01:10:46,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,092 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,093 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,094 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,096 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:46,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,106 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,108 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,109 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,121 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-06 01:10:46,123 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-06 01:10:46,128 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-06 01:10:46,147 INFO L313 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-06 01:10:46,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-06 01:10:46,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-06 01:10:46,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-06 01:10:46,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-06 01:10:46,149 INFO L87 Difference]: Start difference. First operand 32 states and 47 transitions. Second operand 7 states. [2020-10-06 01:10:46,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-06 01:10:46,253 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-10-06 01:10:46,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-06 01:10:46,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-06 01:10:46,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-06 01:10:46,254 INFO L225 Difference]: With dead ends: 40 [2020-10-06 01:10:46,254 INFO L226 Difference]: Without dead ends: 24 [2020-10-06 01:10:46,255 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-10-06 01:10:46,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-06 01:10:46,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-06 01:10:46,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-06 01:10:46,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-06 01:10:46,257 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-10-06 01:10:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-06 01:10:46,257 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-06 01:10:46,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-06 01:10:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-06 01:10:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-06 01:10:46,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-06 01:10:46,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-06 01:10:46,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-06 01:10:46,259 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-06 01:10:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-06 01:10:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash -152137539, now seen corresponding path program 2 times [2020-10-06 01:10:46,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-06 01:10:46,263 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057106227] [2020-10-06 01:10:46,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-06 01:10:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:10:46,301 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:10:46,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-06 01:10:46,337 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-06 01:10:46,367 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-06 01:10:46,368 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-06 01:10:46,368 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-06 01:10:46,369 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-06 01:10:46,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [863] [863] L786-->L793: Formula: (let ((.cse7 (= (mod ~y$r_buff1_thd0~0_In421397045 256) 0)) (.cse6 (= (mod ~y$w_buff1_used~0_In421397045 256) 0)) (.cse8 (= 0 (mod ~y$r_buff0_thd0~0_In421397045 256))) (.cse9 (= (mod ~y$w_buff0_used~0_In421397045 256) 0))) (let ((.cse1 (not .cse9)) (.cse2 (not .cse8)) (.cse0 (or .cse8 .cse9)) (.cse5 (or .cse7 .cse6)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (or (and .cse0 (= ~y$w_buff0_used~0_Out421397045 ~y$w_buff0_used~0_In421397045)) (and (= ~y$w_buff0_used~0_Out421397045 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out421397045 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In421397045| ULTIMATE.start_assume_abort_if_not_~cond_Out421397045) (or (and .cse3 .cse4 (= ~y$w_buff1_used~0_Out421397045 0)) (and .cse5 (= ~y$w_buff1_used~0_Out421397045 ~y$w_buff1_used~0_In421397045))) (or (and (= ~y$w_buff0~0_In421397045 ~y~0_Out421397045) .cse1 .cse2) (and .cse0 (or (and .cse5 (= ~y~0_In421397045 ~y~0_Out421397045)) (and (= ~y$w_buff1~0_In421397045 ~y~0_Out421397045) .cse3 .cse4)))) (= ~y$r_buff1_thd0~0_In421397045 ~y$r_buff1_thd0~0_Out421397045) (= ~y$r_buff0_thd0~0_In421397045 ~y$r_buff0_thd0~0_Out421397045)))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In421397045|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In421397045, ~y$w_buff1~0=~y$w_buff1~0_In421397045, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In421397045, ~y$w_buff0~0=~y$w_buff0~0_In421397045, ~y~0=~y~0_In421397045, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In421397045, ~y$w_buff1_used~0=~y$w_buff1_used~0_In421397045} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out421397045, ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out421397045|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out421397045|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out421397045|, ULTIMATE.start_main_#t~ite16=|ULTIMATE.start_main_#t~ite16_Out421397045|, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out421397045|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out421397045|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In421397045|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out421397045, ~y$w_buff1~0=~y$w_buff1~0_In421397045, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out421397045, ~y$w_buff0~0=~y$w_buff0~0_In421397045, ~y~0=~y~0_Out421397045, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out421397045, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out421397045} AuxVars[] AssignedVars[ULTIMATE.start_assume_abort_if_not_~cond, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite16, ULTIMATE.start_main_#t~ite20, ~y~0, ULTIMATE.start_main_#t~ite21, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-06 01:10:46,382 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-06 01:10:46,383 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,384 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-06 01:10:46,384 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,385 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-06 01:10:46,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,385 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-06 01:10:46,385 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,385 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-06 01:10:46,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,386 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-06 01:10:46,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,386 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-06 01:10:46,386 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,387 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-06 01:10:46,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,387 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-06 01:10:46,387 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,387 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-06 01:10:46,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,388 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-06 01:10:46,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,388 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-06 01:10:46,388 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,389 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-06 01:10:46,389 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,390 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-06 01:10:46,390 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,392 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-06 01:10:46,392 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,392 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-06 01:10:46,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,393 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-06 01:10:46,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,393 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-06 01:10:46,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,393 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-06 01:10:46,393 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,394 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-06 01:10:46,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,394 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-06 01:10:46,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,394 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-06 01:10:46,394 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,395 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-06 01:10:46,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,397 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-06 01:10:46,397 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-06 01:10:46,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.10 01:10:46 BasicIcfg [2020-10-06 01:10:46,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-06 01:10:46,441 INFO L168 Benchmark]: Toolchain (without parser) took 14354.22 ms. Allocated memory was 146.8 MB in the beginning and 351.3 MB in the end (delta: 204.5 MB). Free memory was 101.8 MB in the beginning and 259.5 MB in the end (delta: -157.7 MB). Peak memory consumption was 46.8 MB. Max. memory is 7.1 GB. [2020-10-06 01:10:46,442 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-06 01:10:46,442 INFO L168 Benchmark]: CACSL2BoogieTranslator took 724.76 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 158.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2020-10-06 01:10:46,446 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.51 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 154.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:10:46,450 INFO L168 Benchmark]: Boogie Preprocessor took 37.01 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2020-10-06 01:10:46,451 INFO L168 Benchmark]: RCFGBuilder took 2152.20 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 152.2 MB in the beginning and 200.2 MB in the end (delta: -48.0 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2020-10-06 01:10:46,452 INFO L168 Benchmark]: TraceAbstraction took 11359.09 ms. Allocated memory was 249.0 MB in the beginning and 351.3 MB in the end (delta: 102.2 MB). Free memory was 200.2 MB in the beginning and 259.5 MB in the end (delta: -59.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. [2020-10-06 01:10:46,460 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 146.8 MB. Free memory was 121.5 MB in the beginning and 121.1 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 724.76 ms. Allocated memory was 146.8 MB in the beginning and 203.4 MB in the end (delta: 56.6 MB). Free memory was 101.4 MB in the beginning and 158.0 MB in the end (delta: -56.6 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.51 ms. Allocated memory is still 203.4 MB. Free memory was 158.0 MB in the beginning and 154.1 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.01 ms. Allocated memory is still 203.4 MB. Free memory was 154.1 MB in the beginning and 152.2 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2152.20 ms. Allocated memory was 203.4 MB in the beginning and 249.0 MB in the end (delta: 45.6 MB). Free memory was 152.2 MB in the beginning and 200.2 MB in the end (delta: -48.0 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11359.09 ms. Allocated memory was 249.0 MB in the beginning and 351.3 MB in the end (delta: 102.2 MB). Free memory was 200.2 MB in the beginning and 259.5 MB in the end (delta: -59.3 MB). Peak memory consumption was 43.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.7s, 79 ProgramPointsBefore, 26 ProgramPointsAfterwards, 74 TransitionsBefore, 19 TransitionsAfterwards, 896 CoEnabledTransitionPairs, 7 FixpointIterations, 27 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 475 VarBasedMoverChecksPositive, 28 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 2157 CheckedPairsTotal, 64 TotalNumberOfCompositions - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L697] 0 int __unbuffered_cnt = 0; [L698] 0 _Bool main$tmp_guard0; [L699] 0 _Bool main$tmp_guard1; [L701] 0 int x = 0; [L703] 0 int y = 0; [L704] 0 _Bool y$flush_delayed; [L705] 0 int y$mem_tmp; [L706] 0 _Bool y$r_buff0_thd0; [L707] 0 _Bool y$r_buff0_thd1; [L708] 0 _Bool y$r_buff0_thd2; [L709] 0 _Bool y$r_buff1_thd0; [L710] 0 _Bool y$r_buff1_thd1; [L711] 0 _Bool y$r_buff1_thd2; [L712] 0 _Bool y$read_delayed; [L713] 0 int *y$read_delayed_var; [L714] 0 int y$w_buff0; [L715] 0 _Bool y$w_buff0_used; [L716] 0 int y$w_buff1; [L717] 0 _Bool y$w_buff1_used; [L718] 0 _Bool weak$$choice0; [L719] 0 _Bool weak$$choice2; [L779] 0 pthread_t t2473; [L780] FCALL, FORK 0 pthread_create(&t2473, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 1 y$w_buff1 = y$w_buff0 [L724] 1 y$w_buff0 = 2 [L725] 1 y$w_buff1_used = y$w_buff0_used [L726] 1 y$w_buff0_used = (_Bool)1 [L7] COND TRUE 1 !expression [L7] 1 __VERIFIER_error() [L728] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L729] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L730] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L731] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 pthread_t t2474; [L782] FCALL, FORK 0 pthread_create(&t2474, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L738] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L744] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L746] 1 return 0; [L764] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 2 return 0; [L784] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L795] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L796] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L797] 0 y$flush_delayed = weak$$choice2 [L798] 0 y$mem_tmp = y [L799] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L800] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1 [L801] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L801] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L802] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L803] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L804] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L805] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L806] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L807] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L807] 0 y = y$flush_delayed ? y$mem_tmp : y [L808] 0 y$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, __unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 73 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.7s, HoareTripleCheckerStatistics: 141 SDtfs, 73 SDslu, 161 SDs, 0 SdLazy, 151 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 17 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 79 ConstructedInterpolants, 0 QuantifiedInterpolants, 7220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...