/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-SP.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:02:09,494 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:02:09,497 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:02:09,537 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:02:09,537 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:02:09,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:02:09,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:02:09,552 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:02:09,554 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:02:09,558 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:02:09,559 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:02:09,560 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:02:09,560 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:02:09,564 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:02:09,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:02:09,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:02:09,569 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:02:09,570 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:02:09,571 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:02:09,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:02:09,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:02:09,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:02:09,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:02:09,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:02:09,594 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:02:09,594 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:02:09,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:02:09,595 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:02:09,596 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:02:09,596 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:02:09,596 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:02:09,598 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:02:09,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:02:09,599 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:02:09,601 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:02:09,602 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:02:09,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:02:09,602 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:02:09,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:02:09,605 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:02:09,605 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:02:09,606 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-SP.epf [2020-10-22 02:02:09,650 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:02:09,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:02:09,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:02:09,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:02:09,652 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:02:09,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:02:09,652 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:02:09,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:02:09,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:02:09,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:02:09,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:02:09,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:02:09,655 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:02:09,655 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:02:09,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:02:09,655 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:02:09,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:02:09,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:02:09,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:02:09,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:02:09,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:02:09,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:02:09,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:02:09,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:02:09,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:02:09,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:02:09,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:02:09,658 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:02:09,658 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:02:09,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:02:09,658 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:02:09,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:02:09,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:02:09,960 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:02:09,962 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:02:09,962 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:02:09,963 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2020-10-22 02:02:10,019 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c9620edc/ba36351e4f114710934ebc251ecd67a4/FLAG6e7d17216 [2020-10-22 02:02:10,592 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:02:10,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.opt.i [2020-10-22 02:02:10,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c9620edc/ba36351e4f114710934ebc251ecd67a4/FLAG6e7d17216 [2020-10-22 02:02:10,851 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c9620edc/ba36351e4f114710934ebc251ecd67a4 [2020-10-22 02:02:10,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:02:10,866 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:02:10,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:02:10,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:02:10,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:02:10,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:02:10" (1/1) ... [2020-10-22 02:02:10,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@583129f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:10, skipping insertion in model container [2020-10-22 02:02:10,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:02:10" (1/1) ... [2020-10-22 02:02:10,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:02:10,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:02:11,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:02:11,501 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:02:11,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:02:11,653 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:02:11,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11 WrapperNode [2020-10-22 02:02:11,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:02:11,655 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:02:11,655 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:02:11,655 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:02:11,664 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:02:11,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:02:11,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:02:11,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:02:11,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,787 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... [2020-10-22 02:02:11,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:02:11,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:02:11,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:02:11,814 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:02:11,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:02:11,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:02:11,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:02:11,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:02:11,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:02:11,883 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:02:11,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:02:11,884 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:02:11,884 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:02:11,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:02:11,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:02:11,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:02:11,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:02:11,887 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-22 02:02:13,738 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:02:13,739 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:02:13,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:02:13 BoogieIcfgContainer [2020-10-22 02:02:13,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:02:13,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:02:13,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:02:13,747 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:02:13,747 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:02:10" (1/3) ... [2020-10-22 02:02:13,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8adf2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:02:13, skipping insertion in model container [2020-10-22 02:02:13,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:02:11" (2/3) ... [2020-10-22 02:02:13,749 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8adf2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:02:13, skipping insertion in model container [2020-10-22 02:02:13,749 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:02:13" (3/3) ... [2020-10-22 02:02:13,751 INFO L111 eAbstractionObserver]: Analyzing ICFG mix054_rmo.opt.i [2020-10-22 02:02:13,763 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:02:13,763 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:02:13,771 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:02:13,772 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:02:13,799 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,800 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,800 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,800 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,801 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,803 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,804 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,804 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,804 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,806 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,809 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,821 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,823 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:02:13,825 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:02:13,839 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-10-22 02:02:13,861 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:02:13,861 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:02:13,862 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:02:13,862 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:02:13,862 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:02:13,862 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:02:13,862 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:02:13,862 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:02:13,876 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:02:13,877 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 88 places, 84 transitions, 178 flow [2020-10-22 02:02:13,880 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 88 places, 84 transitions, 178 flow [2020-10-22 02:02:13,882 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 88 places, 84 transitions, 178 flow [2020-10-22 02:02:13,926 INFO L129 PetriNetUnfolder]: 3/82 cut-off events. [2020-10-22 02:02:13,927 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:02:13,931 INFO L80 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 3/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2020-10-22 02:02:13,934 INFO L116 LiptonReduction]: Number of co-enabled transitions 1038 [2020-10-22 02:02:14,377 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2020-10-22 02:02:15,337 WARN L193 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-22 02:02:16,763 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 230 DAG size of output: 190 [2020-10-22 02:02:16,777 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 2, 1] term [2020-10-22 02:02:16,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:02:16,779 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 02:02:16,780 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:02:17,773 WARN L193 SmtUtils]: Spent 956.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 116 [2020-10-22 02:02:19,263 WARN L193 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 227 DAG size of output: 186 [2020-10-22 02:02:19,286 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 2, 1] term [2020-10-22 02:02:19,286 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:02:19,289 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2020-10-22 02:02:19,290 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-22 02:02:20,252 WARN L193 SmtUtils]: Spent 952.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2020-10-22 02:02:20,653 WARN L193 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-22 02:02:20,952 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-10-22 02:02:21,097 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-22 02:02:21,245 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2020-10-22 02:02:21,606 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 106 [2020-10-22 02:02:21,764 WARN L193 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-22 02:02:21,771 INFO L131 LiptonReduction]: Checked pairs total: 2926 [2020-10-22 02:02:21,771 INFO L133 LiptonReduction]: Total number of compositions: 85 [2020-10-22 02:02:21,778 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 26 places, 19 transitions, 48 flow [2020-10-22 02:02:21,795 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 162 states. [2020-10-22 02:02:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2020-10-22 02:02:21,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-22 02:02:21,804 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:21,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-22 02:02:21,805 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash 916373333, now seen corresponding path program 1 times [2020-10-22 02:02:21,841 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:21,841 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641429039] [2020-10-22 02:02:21,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:22,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:22,064 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641429039] [2020-10-22 02:02:22,066 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:22,066 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:02:22,067 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [748287039] [2020-10-22 02:02:22,068 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:22,071 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:22,088 INFO L252 McrAutomatonBuilder]: Finished intersection with 6 states and 5 transitions. [2020-10-22 02:02:22,088 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:22,092 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:22,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:02:22,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:22,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:02:22,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:02:22,111 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 3 states. [2020-10-22 02:02:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:22,197 INFO L93 Difference]: Finished difference Result 137 states and 320 transitions. [2020-10-22 02:02:22,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:02:22,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-22 02:02:22,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:22,217 INFO L225 Difference]: With dead ends: 137 [2020-10-22 02:02:22,217 INFO L226 Difference]: Without dead ends: 112 [2020-10-22 02:02:22,218 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:02:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-10-22 02:02:22,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-10-22 02:02:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-10-22 02:02:22,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 255 transitions. [2020-10-22 02:02:22,269 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 255 transitions. Word has length 5 [2020-10-22 02:02:22,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:22,270 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 255 transitions. [2020-10-22 02:02:22,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:02:22,270 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 255 transitions. [2020-10-22 02:02:22,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 02:02:22,271 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:22,271 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:22,271 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:02:22,271 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:22,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:22,272 INFO L82 PathProgramCache]: Analyzing trace with hash 166530678, now seen corresponding path program 1 times [2020-10-22 02:02:22,273 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:22,273 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870913335] [2020-10-22 02:02:22,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:22,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:22,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:22,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870913335] [2020-10-22 02:02:22,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:22,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:02:22,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2067414121] [2020-10-22 02:02:22,468 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:22,469 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:22,472 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 02:02:22,472 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:22,472 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:22,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:02:22,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:22,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:02:22,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:02:22,475 INFO L87 Difference]: Start difference. First operand 112 states and 255 transitions. Second operand 4 states. [2020-10-22 02:02:22,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:22,518 INFO L93 Difference]: Finished difference Result 110 states and 249 transitions. [2020-10-22 02:02:22,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:02:22,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-10-22 02:02:22,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:22,521 INFO L225 Difference]: With dead ends: 110 [2020-10-22 02:02:22,522 INFO L226 Difference]: Without dead ends: 110 [2020-10-22 02:02:22,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:02:22,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2020-10-22 02:02:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2020-10-22 02:02:22,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2020-10-22 02:02:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 249 transitions. [2020-10-22 02:02:22,535 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 249 transitions. Word has length 7 [2020-10-22 02:02:22,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:22,535 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 249 transitions. [2020-10-22 02:02:22,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:02:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 249 transitions. [2020-10-22 02:02:22,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-10-22 02:02:22,537 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:22,537 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:22,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:02:22,537 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:22,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash 867482972, now seen corresponding path program 1 times [2020-10-22 02:02:22,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:22,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383654316] [2020-10-22 02:02:22,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:22,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383654316] [2020-10-22 02:02:22,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:22,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:02:22,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1424955458] [2020-10-22 02:02:22,661 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:22,663 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:22,665 INFO L252 McrAutomatonBuilder]: Finished intersection with 9 states and 8 transitions. [2020-10-22 02:02:22,666 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:22,666 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:22,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:02:22,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:22,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:02:22,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:02:22,667 INFO L87 Difference]: Start difference. First operand 110 states and 249 transitions. Second operand 5 states. [2020-10-22 02:02:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:22,722 INFO L93 Difference]: Finished difference Result 106 states and 237 transitions. [2020-10-22 02:02:22,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:02:22,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-10-22 02:02:22,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:22,729 INFO L225 Difference]: With dead ends: 106 [2020-10-22 02:02:22,729 INFO L226 Difference]: Without dead ends: 106 [2020-10-22 02:02:22,729 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-22 02:02:22,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-22 02:02:22,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2020-10-22 02:02:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-10-22 02:02:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 237 transitions. [2020-10-22 02:02:22,741 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 237 transitions. Word has length 8 [2020-10-22 02:02:22,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:22,741 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 237 transitions. [2020-10-22 02:02:22,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:02:22,742 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 237 transitions. [2020-10-22 02:02:22,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:02:22,743 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:22,743 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:22,743 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:02:22,743 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:22,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:22,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1731741799, now seen corresponding path program 1 times [2020-10-22 02:02:22,746 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:22,746 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745034115] [2020-10-22 02:02:22,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:22,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:22,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745034115] [2020-10-22 02:02:22,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:22,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:02:22,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [979727268] [2020-10-22 02:02:22,849 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:22,850 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:22,853 INFO L252 McrAutomatonBuilder]: Finished intersection with 16 states and 21 transitions. [2020-10-22 02:02:22,853 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:22,966 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:22,966 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:02:22,967 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:02:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:02:22,967 INFO L87 Difference]: Start difference. First operand 106 states and 237 transitions. Second operand 5 states. [2020-10-22 02:02:23,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:23,040 INFO L93 Difference]: Finished difference Result 106 states and 236 transitions. [2020-10-22 02:02:23,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:02:23,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-22 02:02:23,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:23,044 INFO L225 Difference]: With dead ends: 106 [2020-10-22 02:02:23,044 INFO L226 Difference]: Without dead ends: 106 [2020-10-22 02:02:23,045 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:02:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2020-10-22 02:02:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2020-10-22 02:02:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2020-10-22 02:02:23,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 234 transitions. [2020-10-22 02:02:23,053 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 234 transitions. Word has length 9 [2020-10-22 02:02:23,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:23,054 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 234 transitions. [2020-10-22 02:02:23,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:02:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 234 transitions. [2020-10-22 02:02:23,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:02:23,055 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:23,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:23,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:02:23,056 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 161987160, now seen corresponding path program 1 times [2020-10-22 02:02:23,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:23,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701039384] [2020-10-22 02:02:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:23,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:23,217 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701039384] [2020-10-22 02:02:23,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:23,218 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:02:23,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1661900981] [2020-10-22 02:02:23,218 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:23,220 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:23,222 INFO L252 McrAutomatonBuilder]: Finished intersection with 20 states and 28 transitions. [2020-10-22 02:02:23,223 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:23,258 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:02:23,258 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,260 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:02:23,260 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,264 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:02:23,264 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,267 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,280 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,285 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,298 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:02:23,298 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,300 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,309 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,310 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:02:23,324 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:02:23,326 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,330 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,335 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,343 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:02:23,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,378 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,382 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,386 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,395 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:23,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,402 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,403 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,403 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:02:23,412 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,421 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,429 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:02:23,431 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:23,433 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,443 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:23,444 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:02:23,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,456 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:02:23,473 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,474 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:23,481 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,482 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,492 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,497 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,500 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,619 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 3, 2, 1] term [2020-10-22 02:02:23,620 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,621 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:02:23,622 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,625 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 2, 1] term [2020-10-22 02:02:23,626 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,627 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,632 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,645 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,651 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:02:23,652 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:23,673 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:02:23,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:02:23,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:02:23,697 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,711 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:02:23,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,741 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,744 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,750 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,755 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,769 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:02:23,770 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,821 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,842 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,843 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,844 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:23,849 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,865 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:02:23,869 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 4 conjuncts [2020-10-22 02:02:23,870 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,879 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,880 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,938 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,957 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,958 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:23,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,965 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:23,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,976 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,977 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:23,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:23,997 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,011 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,012 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,013 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,031 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,032 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,047 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,048 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,052 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,069 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,070 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,070 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,074 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,086 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,087 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,087 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,091 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,101 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,102 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,105 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,118 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:24,123 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:24,125 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:24,129 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,130 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 5 conjuncts [2020-10-22 02:02:24,130 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,141 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:02:24,148 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,151 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,152 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,155 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:24,158 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:24,160 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:24,165 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:02:24,169 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:02:24,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,176 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,177 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,192 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,193 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,194 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,197 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,207 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,208 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,209 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:02:24,212 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:02:24,439 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:24,439 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:02:24,440 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:24,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:02:24,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:02:24,441 INFO L87 Difference]: Start difference. First operand 105 states and 234 transitions. Second operand 5 states. [2020-10-22 02:02:24,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:24,501 INFO L93 Difference]: Finished difference Result 104 states and 231 transitions. [2020-10-22 02:02:24,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:02:24,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-22 02:02:24,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:24,504 INFO L225 Difference]: With dead ends: 104 [2020-10-22 02:02:24,504 INFO L226 Difference]: Without dead ends: 104 [2020-10-22 02:02:24,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-22 02:02:24,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-22 02:02:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2020-10-22 02:02:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-10-22 02:02:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 229 transitions. [2020-10-22 02:02:24,512 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 229 transitions. Word has length 10 [2020-10-22 02:02:24,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:24,513 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 229 transitions. [2020-10-22 02:02:24,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:02:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 229 transitions. [2020-10-22 02:02:24,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:02:24,514 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:24,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:24,515 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:02:24,515 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:24,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:24,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2144387467, now seen corresponding path program 1 times [2020-10-22 02:02:24,517 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:24,518 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974119667] [2020-10-22 02:02:24,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:24,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:24,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:24,785 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974119667] [2020-10-22 02:02:24,785 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:24,785 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:02:24,785 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [55903420] [2020-10-22 02:02:24,786 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:24,791 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:24,795 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-22 02:02:24,796 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:24,941 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:24,941 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:02:24,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:24,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:02:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:02:24,943 INFO L87 Difference]: Start difference. First operand 103 states and 229 transitions. Second operand 6 states. [2020-10-22 02:02:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:25,094 INFO L93 Difference]: Finished difference Result 113 states and 249 transitions. [2020-10-22 02:02:25,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:02:25,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-10-22 02:02:25,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:25,101 INFO L225 Difference]: With dead ends: 113 [2020-10-22 02:02:25,101 INFO L226 Difference]: Without dead ends: 113 [2020-10-22 02:02:25,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:02:25,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2020-10-22 02:02:25,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2020-10-22 02:02:25,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-10-22 02:02:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 249 transitions. [2020-10-22 02:02:25,124 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 249 transitions. Word has length 10 [2020-10-22 02:02:25,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:25,125 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 249 transitions. [2020-10-22 02:02:25,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:02:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 249 transitions. [2020-10-22 02:02:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:02:25,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:25,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:25,127 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:02:25,127 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:25,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:25,128 INFO L82 PathProgramCache]: Analyzing trace with hash 427426939, now seen corresponding path program 1 times [2020-10-22 02:02:25,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:25,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719702837] [2020-10-22 02:02:25,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:25,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:25,294 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719702837] [2020-10-22 02:02:25,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:25,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:02:25,295 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519313280] [2020-10-22 02:02:25,296 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:25,298 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:25,301 INFO L252 McrAutomatonBuilder]: Finished intersection with 11 states and 10 transitions. [2020-10-22 02:02:25,301 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:25,302 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:25,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:02:25,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:02:25,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:02:25,303 INFO L87 Difference]: Start difference. First operand 113 states and 249 transitions. Second operand 4 states. [2020-10-22 02:02:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:25,340 INFO L93 Difference]: Finished difference Result 100 states and 187 transitions. [2020-10-22 02:02:25,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:02:25,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 02:02:25,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:25,342 INFO L225 Difference]: With dead ends: 100 [2020-10-22 02:02:25,342 INFO L226 Difference]: Without dead ends: 71 [2020-10-22 02:02:25,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:02:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-22 02:02:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-22 02:02:25,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-22 02:02:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 123 transitions. [2020-10-22 02:02:25,348 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 123 transitions. Word has length 10 [2020-10-22 02:02:25,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:25,348 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 123 transitions. [2020-10-22 02:02:25,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:02:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 123 transitions. [2020-10-22 02:02:25,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-22 02:02:25,350 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:25,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:25,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:02:25,350 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:25,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:25,350 INFO L82 PathProgramCache]: Analyzing trace with hash 859195324, now seen corresponding path program 1 times [2020-10-22 02:02:25,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:25,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461953148] [2020-10-22 02:02:25,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:25,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461953148] [2020-10-22 02:02:25,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:25,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:02:25,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2033519593] [2020-10-22 02:02:25,451 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:25,453 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:25,455 INFO L252 McrAutomatonBuilder]: Finished intersection with 12 states and 11 transitions. [2020-10-22 02:02:25,455 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:25,456 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:25,456 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-22 02:02:25,457 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:25,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-22 02:02:25,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:02:25,457 INFO L87 Difference]: Start difference. First operand 71 states and 123 transitions. Second operand 5 states. [2020-10-22 02:02:25,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:25,502 INFO L93 Difference]: Finished difference Result 55 states and 89 transitions. [2020-10-22 02:02:25,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:02:25,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-22 02:02:25,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:25,504 INFO L225 Difference]: With dead ends: 55 [2020-10-22 02:02:25,505 INFO L226 Difference]: Without dead ends: 44 [2020-10-22 02:02:25,505 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:02:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-22 02:02:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2020-10-22 02:02:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-22 02:02:25,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 63 transitions. [2020-10-22 02:02:25,509 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 63 transitions. Word has length 11 [2020-10-22 02:02:25,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:25,509 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 63 transitions. [2020-10-22 02:02:25,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-22 02:02:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 63 transitions. [2020-10-22 02:02:25,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:02:25,510 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:25,511 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:25,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:02:25,511 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:25,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:25,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1015613484, now seen corresponding path program 1 times [2020-10-22 02:02:25,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:25,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664596061] [2020-10-22 02:02:25,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:02:25,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-22 02:02:25,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664596061] [2020-10-22 02:02:25,584 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:02:25,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:02:25,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [790154862] [2020-10-22 02:02:25,585 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:02:25,591 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:02:25,601 INFO L252 McrAutomatonBuilder]: Finished intersection with 27 states and 37 transitions. [2020-10-22 02:02:25,601 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:02:25,829 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:02:25,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:02:25,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:02:25,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:02:25,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:02:25,831 INFO L87 Difference]: Start difference. First operand 40 states and 63 transitions. Second operand 4 states. [2020-10-22 02:02:25,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:02:25,854 INFO L93 Difference]: Finished difference Result 54 states and 82 transitions. [2020-10-22 02:02:25,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:02:25,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-22 02:02:25,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:02:25,856 INFO L225 Difference]: With dead ends: 54 [2020-10-22 02:02:25,856 INFO L226 Difference]: Without dead ends: 24 [2020-10-22 02:02:25,857 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-22 02:02:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-10-22 02:02:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-10-22 02:02:25,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-22 02:02:25,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2020-10-22 02:02:25,859 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 15 [2020-10-22 02:02:25,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:02:25,859 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2020-10-22 02:02:25,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:02:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2020-10-22 02:02:25,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:02:25,860 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:02:25,860 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:02:25,860 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:02:25,860 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:02:25,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:02:25,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1062004012, now seen corresponding path program 2 times [2020-10-22 02:02:25,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:02:25,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64115307] [2020-10-22 02:02:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:02:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:02:25,913 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:02:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:02:25,968 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:02:26,006 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:02:26,007 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:02:26,007 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-22 02:02:26,008 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:02:26,019 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L799-->L806: Formula: (let ((.cse8 (= (mod ~x$r_buff1_thd0~0_In-1229075186 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In-1229075186 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In-1229075186 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-1229075186 256) 0))) (let ((.cse2 (or .cse6 .cse7)) (.cse5 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (or (and .cse0 (= ~x$w_buff0_used~0_Out-1229075186 0) .cse1) (and .cse2 (= ~x$w_buff0_used~0_Out-1229075186 ~x$w_buff0_used~0_In-1229075186))) (or (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out-1229075186 0)) (and (= ~x$w_buff1_used~0_In-1229075186 ~x$w_buff1_used~0_Out-1229075186) .cse5)) (= ~x$r_buff0_thd0~0_In-1229075186 ~x$r_buff0_thd0~0_Out-1229075186) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1229075186 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-1229075186|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-1229075186 0)) (or (and .cse2 (or (and .cse5 (= ~x~0_In-1229075186 ~x~0_Out-1229075186)) (and .cse3 (= ~x~0_Out-1229075186 ~x$w_buff1~0_In-1229075186) .cse4))) (and .cse0 (= ~x$w_buff0~0_In-1229075186 ~x~0_Out-1229075186) .cse1)) (= ~x$r_buff1_thd0~0_Out-1229075186 ~x$r_buff1_thd0~0_In-1229075186)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1229075186, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1229075186, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1229075186|, ~x$w_buff1~0=~x$w_buff1~0_In-1229075186, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1229075186, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1229075186, ~x~0=~x~0_In-1229075186, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1229075186} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1229075186, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-1229075186, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1229075186|, ~x$w_buff1~0=~x$w_buff1~0_In-1229075186, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1229075186|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-1229075186, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-1229075186, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1229075186|, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out-1229075186|, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1229075186|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-1229075186, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1229075186|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-1229075186|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-1229075186, ~x~0=~x~0_Out-1229075186} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite21, ~x~0, ULTIMATE.start_main_#t~ite22, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-22 02:02:26,026 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,026 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [755] [2020-10-22 02:02:26,027 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,028 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,028 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,029 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,029 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,030 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,030 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,031 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,031 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,032 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,032 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,033 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,033 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,034 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,034 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,035 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,035 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,036 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,039 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,039 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,040 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,040 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,041 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-22 02:02:26,041 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:02:26,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:02:26 BasicIcfg [2020-10-22 02:02:26,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:02:26,093 INFO L168 Benchmark]: Toolchain (without parser) took 15231.06 ms. Allocated memory was 140.0 MB in the beginning and 377.0 MB in the end (delta: 237.0 MB). Free memory was 101.7 MB in the beginning and 199.6 MB in the end (delta: -97.9 MB). Peak memory consumption was 139.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:02:26,093 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-10-22 02:02:26,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 786.51 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 154.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:02:26,095 INFO L168 Benchmark]: Boogie Procedure Inliner took 81.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-10-22 02:02:26,096 INFO L168 Benchmark]: Boogie Preprocessor took 76.93 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:02:26,096 INFO L168 Benchmark]: RCFGBuilder took 1927.97 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 148.6 MB in the beginning and 193.5 MB in the end (delta: -45.0 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. [2020-10-22 02:02:26,097 INFO L168 Benchmark]: TraceAbstraction took 12345.12 ms. Allocated memory was 248.5 MB in the beginning and 377.0 MB in the end (delta: 128.5 MB). Free memory was 193.5 MB in the beginning and 199.6 MB in the end (delta: -6.1 MB). Peak memory consumption was 122.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:02:26,102 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 140.0 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 786.51 ms. Allocated memory was 140.0 MB in the beginning and 202.9 MB in the end (delta: 62.9 MB). Free memory was 100.7 MB in the beginning and 154.1 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 81.28 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.93 ms. Allocated memory is still 202.9 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1927.97 ms. Allocated memory was 202.9 MB in the beginning and 248.5 MB in the end (delta: 45.6 MB). Free memory was 148.6 MB in the beginning and 193.5 MB in the end (delta: -45.0 MB). Peak memory consumption was 102.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12345.12 ms. Allocated memory was 248.5 MB in the beginning and 377.0 MB in the end (delta: 128.5 MB). Free memory was 193.5 MB in the beginning and 199.6 MB in the end (delta: -6.1 MB). Peak memory consumption was 122.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 546 VarBasedMoverChecksPositive, 32 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 36 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.8s, 88 PlacesBefore, 26 PlacesAfterwards, 84 TransitionsBefore, 19 TransitionsAfterwards, 1038 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 3 ChoiceCompositions, 85 TotalNumberOfCompositions, 2926 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1451; [L793] FCALL, FORK 0 pthread_create(&t1451, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 0 pthread_t t1452; [L795] FCALL, FORK 0 pthread_create(&t1452, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L770] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L770] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L771] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L772] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0 [L813] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L813] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L814] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L814] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix054_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 82 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.9s, HoareTripleCheckerStatistics: 138 SDtfs, 119 SDslu, 162 SDs, 0 SdLazy, 137 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred 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, 9 MinimizatonAttempts, 6 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 4961 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...