/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/safe034_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-1d1d2b5 [2020-10-22 02:22:09,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-22 02:22:09,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-22 02:22:09,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-22 02:22:09,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-22 02:22:09,614 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-22 02:22:09,615 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-22 02:22:09,617 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-22 02:22:09,619 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-22 02:22:09,619 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-22 02:22:09,620 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-22 02:22:09,621 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-22 02:22:09,622 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-22 02:22:09,623 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-22 02:22:09,624 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-22 02:22:09,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-22 02:22:09,625 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-22 02:22:09,626 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-22 02:22:09,628 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-22 02:22:09,630 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-22 02:22:09,632 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-22 02:22:09,633 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-22 02:22:09,634 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-22 02:22:09,635 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-22 02:22:09,638 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-22 02:22:09,638 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-22 02:22:09,639 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-22 02:22:09,640 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-22 02:22:09,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-22 02:22:09,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-22 02:22:09,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-22 02:22:09,642 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-22 02:22:09,643 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-22 02:22:09,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-22 02:22:09,645 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-22 02:22:09,645 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-22 02:22:09,646 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-22 02:22:09,646 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-22 02:22:09,647 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-22 02:22:09,648 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-22 02:22:09,648 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-22 02:22:09,649 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:22:09,686 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-22 02:22:09,686 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-22 02:22:09,688 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-22 02:22:09,688 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-22 02:22:09,688 INFO L138 SettingsManager]: * Use SBE=true [2020-10-22 02:22:09,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-22 02:22:09,689 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-22 02:22:09,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-22 02:22:09,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-22 02:22:09,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-22 02:22:09,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-22 02:22:09,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-22 02:22:09,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-22 02:22:09,691 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-22 02:22:09,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-22 02:22:09,691 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-22 02:22:09,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-22 02:22:09,693 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-22 02:22:09,693 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-22 02:22:09,693 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-22 02:22:09,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-22 02:22:09,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-22 02:22:09,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-22 02:22:09,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-22 02:22:09,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-22 02:22:09,695 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-22 02:22:09,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-22 02:22:09,695 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2020-10-22 02:22:09,695 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-22 02:22:09,696 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-22 02:22:09,696 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2020-10-22 02:22:09,983 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-22 02:22:09,996 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-22 02:22:09,999 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-22 02:22:10,001 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-22 02:22:10,001 INFO L275 PluginConnector]: CDTParser initialized [2020-10-22 02:22:10,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_pso.opt.i [2020-10-22 02:22:10,076 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb5d899e/4c60efeb44834e55b5c6c505ccc1d1e1/FLAG8ec3dc817 [2020-10-22 02:22:10,675 INFO L306 CDTParser]: Found 1 translation units. [2020-10-22 02:22:10,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_pso.opt.i [2020-10-22 02:22:10,689 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb5d899e/4c60efeb44834e55b5c6c505ccc1d1e1/FLAG8ec3dc817 [2020-10-22 02:22:10,909 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbb5d899e/4c60efeb44834e55b5c6c505ccc1d1e1 [2020-10-22 02:22:10,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-22 02:22:10,925 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-22 02:22:10,926 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-22 02:22:10,926 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-22 02:22:10,930 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-22 02:22:10,930 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:22:10" (1/1) ... [2020-10-22 02:22:10,933 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745ca6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:10, skipping insertion in model container [2020-10-22 02:22:10,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 02:22:10" (1/1) ... [2020-10-22 02:22:10,941 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-22 02:22:10,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-22 02:22:11,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:22:11,568 INFO L203 MainTranslator]: Completed pre-run [2020-10-22 02:22:11,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-22 02:22:11,701 INFO L208 MainTranslator]: Completed translation [2020-10-22 02:22:11,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11 WrapperNode [2020-10-22 02:22:11,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-22 02:22:11,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-22 02:22:11,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-22 02:22:11,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-22 02:22:11,712 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:22:11" (1/1) ... [2020-10-22 02:22:11,731 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:22:11" (1/1) ... [2020-10-22 02:22:11,762 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-22 02:22:11,763 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-22 02:22:11,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-22 02:22:11,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-22 02:22:11,773 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11" (1/1) ... [2020-10-22 02:22:11,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11" (1/1) ... [2020-10-22 02:22:11,779 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11" (1/1) ... [2020-10-22 02:22:11,780 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11" (1/1) ... [2020-10-22 02:22:11,791 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11" (1/1) ... [2020-10-22 02:22:11,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11" (1/1) ... [2020-10-22 02:22:11,800 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11" (1/1) ... [2020-10-22 02:22:11,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-22 02:22:11,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-22 02:22:11,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-22 02:22:11,805 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-22 02:22:11,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22: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:22:11,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-22 02:22:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-22 02:22:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-22 02:22:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-22 02:22:11,874 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-22 02:22:11,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-22 02:22:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-22 02:22:11,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-22 02:22:11,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-22 02:22:11,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-22 02:22:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-22 02:22:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-22 02:22:11,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-22 02:22:11,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-22 02:22:11,879 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:22:13,615 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-22 02:22:13,615 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-10-22 02:22:13,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:22:13 BoogieIcfgContainer [2020-10-22 02:22:13,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-22 02:22:13,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-22 02:22:13,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-22 02:22:13,626 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-22 02:22:13,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 02:22:10" (1/3) ... [2020-10-22 02:22:13,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65417a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:22:13, skipping insertion in model container [2020-10-22 02:22:13,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 02:22:11" (2/3) ... [2020-10-22 02:22:13,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65417a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 02:22:13, skipping insertion in model container [2020-10-22 02:22:13,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 02:22:13" (3/3) ... [2020-10-22 02:22:13,631 INFO L111 eAbstractionObserver]: Analyzing ICFG safe034_pso.opt.i [2020-10-22 02:22:13,642 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-22 02:22:13,643 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-22 02:22:13,652 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-22 02:22:13,653 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-22 02:22:13,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,691 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,692 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,692 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,693 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,693 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,693 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,694 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,695 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,696 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,697 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,698 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,700 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,701 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,702 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,704 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,705 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,706 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,706 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,706 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,707 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,707 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,708 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,708 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,709 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,710 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,711 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,716 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,717 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,719 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,720 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,721 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,722 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,723 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,724 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,724 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,725 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,726 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,735 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,736 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,739 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,740 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,740 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-22 02:22:13,741 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-22 02:22:13,755 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-22 02:22:13,775 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-22 02:22:13,776 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-22 02:22:13,776 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-22 02:22:13,776 INFO L380 AbstractCegarLoop]: Backedges is MCR [2020-10-22 02:22:13,776 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-22 02:22:13,776 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-22 02:22:13,776 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-22 02:22:13,776 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-22 02:22:13,790 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-22 02:22:13,791 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 02:22:13,794 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 100 transitions, 215 flow [2020-10-22 02:22:13,796 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 107 places, 100 transitions, 215 flow [2020-10-22 02:22:13,843 INFO L129 PetriNetUnfolder]: 3/97 cut-off events. [2020-10-22 02:22:13,844 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-22 02:22:13,849 INFO L80 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-10-22 02:22:13,852 INFO L116 LiptonReduction]: Number of co-enabled transitions 1648 [2020-10-22 02:22:14,476 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-10-22 02:22:15,317 WARN L193 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2020-10-22 02:22:15,818 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2020-10-22 02:22:16,711 WARN L193 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 114 [2020-10-22 02:22:16,883 WARN L193 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-10-22 02:22:16,894 INFO L131 LiptonReduction]: Checked pairs total: 3809 [2020-10-22 02:22:16,895 INFO L133 LiptonReduction]: Total number of compositions: 94 [2020-10-22 02:22:16,901 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 34 places, 24 transitions, 63 flow [2020-10-22 02:22:16,935 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 522 states. [2020-10-22 02:22:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states. [2020-10-22 02:22:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-10-22 02:22:16,944 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:16,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:16,946 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1661291912, now seen corresponding path program 1 times [2020-10-22 02:22:16,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:16,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830321464] [2020-10-22 02:22:16,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:22:17,198 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:22:17,199 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830321464] [2020-10-22 02:22:17,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:22:17,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:22:17,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [715615515] [2020-10-22 02:22:17,201 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:22:17,204 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:22:17,218 INFO L252 McrAutomatonBuilder]: Finished intersection with 8 states and 7 transitions. [2020-10-22 02:22:17,219 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:22:17,223 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:22:17,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:22:17,224 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:22:17,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:22:17,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:22:17,241 INFO L87 Difference]: Start difference. First operand 522 states. Second operand 3 states. [2020-10-22 02:22:17,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:22:17,340 INFO L93 Difference]: Finished difference Result 442 states and 1336 transitions. [2020-10-22 02:22:17,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:22:17,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-10-22 02:22:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:22:17,370 INFO L225 Difference]: With dead ends: 442 [2020-10-22 02:22:17,370 INFO L226 Difference]: Without dead ends: 362 [2020-10-22 02:22:17,373 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:22:17,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2020-10-22 02:22:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2020-10-22 02:22:17,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2020-10-22 02:22:17,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 1072 transitions. [2020-10-22 02:22:17,452 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 1072 transitions. Word has length 7 [2020-10-22 02:22:17,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:22:17,453 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 1072 transitions. [2020-10-22 02:22:17,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:22:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 1072 transitions. [2020-10-22 02:22:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-22 02:22:17,455 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:17,455 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:17,455 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-22 02:22:17,455 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:17,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:17,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1226276821, now seen corresponding path program 1 times [2020-10-22 02:22:17,457 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:17,457 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460205003] [2020-10-22 02:22:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:22:17,532 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:22:17,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460205003] [2020-10-22 02:22:17,533 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:22:17,533 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-22 02:22:17,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [323870320] [2020-10-22 02:22:17,533 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:22:17,534 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:22:17,536 INFO L252 McrAutomatonBuilder]: Finished intersection with 10 states and 9 transitions. [2020-10-22 02:22:17,536 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:22:17,537 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:22:17,538 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:22:17,538 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:22:17,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:22:17,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:22:17,539 INFO L87 Difference]: Start difference. First operand 362 states and 1072 transitions. Second operand 3 states. [2020-10-22 02:22:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:22:17,570 INFO L93 Difference]: Finished difference Result 354 states and 1042 transitions. [2020-10-22 02:22:17,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:22:17,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-22 02:22:17,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:22:17,578 INFO L225 Difference]: With dead ends: 354 [2020-10-22 02:22:17,578 INFO L226 Difference]: Without dead ends: 354 [2020-10-22 02:22:17,579 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:22:17,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2020-10-22 02:22:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2020-10-22 02:22:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2020-10-22 02:22:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 1042 transitions. [2020-10-22 02:22:17,631 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 1042 transitions. Word has length 9 [2020-10-22 02:22:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:22:17,632 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 1042 transitions. [2020-10-22 02:22:17,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:22:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 1042 transitions. [2020-10-22 02:22:17,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-22 02:22:17,634 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:17,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:17,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-22 02:22:17,634 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:17,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash -712151592, now seen corresponding path program 1 times [2020-10-22 02:22:17,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:17,639 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57404737] [2020-10-22 02:22:17,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:22:17,715 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:22:17,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57404737] [2020-10-22 02:22:17,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:22:17,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:22:17,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300389587] [2020-10-22 02:22:17,716 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:22:17,718 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:22:17,720 INFO L252 McrAutomatonBuilder]: Finished intersection with 17 states and 22 transitions. [2020-10-22 02:22:17,720 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:22:17,797 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:22:17,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:22:17,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:22:17,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:22:17,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:22:17,799 INFO L87 Difference]: Start difference. First operand 354 states and 1042 transitions. Second operand 4 states. [2020-10-22 02:22:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:22:17,834 INFO L93 Difference]: Finished difference Result 332 states and 854 transitions. [2020-10-22 02:22:17,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:22:17,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-10-22 02:22:17,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:22:17,837 INFO L225 Difference]: With dead ends: 332 [2020-10-22 02:22:17,837 INFO L226 Difference]: Without dead ends: 252 [2020-10-22 02:22:17,838 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:22:17,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-10-22 02:22:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2020-10-22 02:22:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2020-10-22 02:22:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 634 transitions. [2020-10-22 02:22:17,847 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 634 transitions. Word has length 10 [2020-10-22 02:22:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:22:17,848 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 634 transitions. [2020-10-22 02:22:17,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:22:17,848 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 634 transitions. [2020-10-22 02:22:17,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-22 02:22:17,849 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:17,849 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:17,850 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-22 02:22:17,850 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:17,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:17,850 INFO L82 PathProgramCache]: Analyzing trace with hash -430582493, now seen corresponding path program 1 times [2020-10-22 02:22:17,851 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:17,852 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861652527] [2020-10-22 02:22:17,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:17,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:22:17,927 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:22:17,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861652527] [2020-10-22 02:22:17,927 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:22:17,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:22:17,928 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [562284126] [2020-10-22 02:22:17,928 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:22:17,929 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:22:17,933 INFO L252 McrAutomatonBuilder]: Finished intersection with 25 states and 36 transitions. [2020-10-22 02:22:17,933 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:22:18,104 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [4235#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:22:18,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-22 02:22:18,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:22:18,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-22 02:22:18,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-22 02:22:18,106 INFO L87 Difference]: Start difference. First operand 252 states and 634 transitions. Second operand 6 states. [2020-10-22 02:22:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:22:18,169 INFO L93 Difference]: Finished difference Result 199 states and 452 transitions. [2020-10-22 02:22:18,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-22 02:22:18,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-10-22 02:22:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:22:18,172 INFO L225 Difference]: With dead ends: 199 [2020-10-22 02:22:18,172 INFO L226 Difference]: Without dead ends: 155 [2020-10-22 02:22:18,172 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-10-22 02:22:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2020-10-22 02:22:18,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2020-10-22 02:22:18,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2020-10-22 02:22:18,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 343 transitions. [2020-10-22 02:22:18,177 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 343 transitions. Word has length 12 [2020-10-22 02:22:18,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:22:18,178 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 343 transitions. [2020-10-22 02:22:18,178 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-22 02:22:18,178 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 343 transitions. [2020-10-22 02:22:18,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-22 02:22:18,179 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:18,180 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:18,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-22 02:22:18,180 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:18,180 INFO L82 PathProgramCache]: Analyzing trace with hash 290711485, now seen corresponding path program 1 times [2020-10-22 02:22:18,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:18,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059686974] [2020-10-22 02:22:18,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:22:18,395 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:22:18,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059686974] [2020-10-22 02:22:18,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:22:18,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-22 02:22:18,396 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1309173902] [2020-10-22 02:22:18,396 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:22:18,399 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:22:18,408 INFO L252 McrAutomatonBuilder]: Finished intersection with 40 states and 67 transitions. [2020-10-22 02:22:18,408 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:22:19,056 WARN L193 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 228 DAG size of output: 3 [2020-10-22 02:22:19,662 WARN L193 SmtUtils]: Spent 477.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 3 [2020-10-22 02:22:20,298 WARN L193 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 3 [2020-10-22 02:22:20,413 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [4755#(<= ~__unbuffered_cnt~0 0)] [2020-10-22 02:22:20,413 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:22:20,414 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:22:20,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:22:20,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:22:20,415 INFO L87 Difference]: Start difference. First operand 155 states and 343 transitions. Second operand 7 states. [2020-10-22 02:22:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:22:20,488 INFO L93 Difference]: Finished difference Result 136 states and 303 transitions. [2020-10-22 02:22:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:22:20,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2020-10-22 02:22:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:22:20,490 INFO L225 Difference]: With dead ends: 136 [2020-10-22 02:22:20,490 INFO L226 Difference]: Without dead ends: 125 [2020-10-22 02:22:20,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2020-10-22 02:22:20,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2020-10-22 02:22:20,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2020-10-22 02:22:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-10-22 02:22:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 283 transitions. [2020-10-22 02:22:20,499 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 283 transitions. Word has length 15 [2020-10-22 02:22:20,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:22:20,506 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 283 transitions. [2020-10-22 02:22:20,506 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:22:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 283 transitions. [2020-10-22 02:22:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:22:20,508 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:20,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:20,508 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-22 02:22:20,508 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:20,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash 256181764, now seen corresponding path program 1 times [2020-10-22 02:22:20,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:20,519 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575988115] [2020-10-22 02:22:20,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:22:20,577 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:22:20,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575988115] [2020-10-22 02:22:20,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:22:20,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-22 02:22:20,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [392411489] [2020-10-22 02:22:20,579 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:22:20,584 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:22:20,614 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 88 transitions. [2020-10-22 02:22:20,615 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:22:20,859 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:22:20,860 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-22 02:22:20,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:22:20,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-22 02:22:20,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-22 02:22:20,861 INFO L87 Difference]: Start difference. First operand 125 states and 283 transitions. Second operand 3 states. [2020-10-22 02:22:20,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:22:20,869 INFO L93 Difference]: Finished difference Result 163 states and 360 transitions. [2020-10-22 02:22:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-22 02:22:20,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-10-22 02:22:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:22:20,871 INFO L225 Difference]: With dead ends: 163 [2020-10-22 02:22:20,871 INFO L226 Difference]: Without dead ends: 71 [2020-10-22 02:22:20,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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:22:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-10-22 02:22:20,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2020-10-22 02:22:20,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-10-22 02:22:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 139 transitions. [2020-10-22 02:22:20,874 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 139 transitions. Word has length 19 [2020-10-22 02:22:20,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:22:20,875 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 139 transitions. [2020-10-22 02:22:20,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-22 02:22:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 139 transitions. [2020-10-22 02:22:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:22:20,876 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:20,876 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:20,876 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-22 02:22:20,876 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:20,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:20,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1857331524, now seen corresponding path program 2 times [2020-10-22 02:22:20,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:20,878 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163642782] [2020-10-22 02:22:20,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:20,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:22:20,936 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:22:20,936 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163642782] [2020-10-22 02:22:20,937 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:22:20,937 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-22 02:22:20,937 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1277045501] [2020-10-22 02:22:20,937 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:22:20,942 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:22:20,958 INFO L252 McrAutomatonBuilder]: Finished intersection with 47 states and 75 transitions. [2020-10-22 02:22:20,959 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:22:21,297 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 3 [2020-10-22 02:22:21,841 WARN L193 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 3 [2020-10-22 02:22:21,964 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 0 new interpolants: [] [2020-10-22 02:22:21,965 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-22 02:22:21,965 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:22:21,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-22 02:22:21,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-22 02:22:21,966 INFO L87 Difference]: Start difference. First operand 71 states and 139 transitions. Second operand 4 states. [2020-10-22 02:22:21,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:22:21,983 INFO L93 Difference]: Finished difference Result 91 states and 174 transitions. [2020-10-22 02:22:21,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-22 02:22:21,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-22 02:22:21,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:22:21,985 INFO L225 Difference]: With dead ends: 91 [2020-10-22 02:22:21,985 INFO L226 Difference]: Without dead ends: 41 [2020-10-22 02:22:21,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:22:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-22 02:22:21,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-22 02:22:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-22 02:22:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 67 transitions. [2020-10-22 02:22:21,987 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 67 transitions. Word has length 19 [2020-10-22 02:22:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:22:21,988 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 67 transitions. [2020-10-22 02:22:21,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-22 02:22:21,988 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 67 transitions. [2020-10-22 02:22:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:22:21,989 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:21,989 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:21,989 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-22 02:22:21,989 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:21,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:21,990 INFO L82 PathProgramCache]: Analyzing trace with hash 435228276, now seen corresponding path program 3 times [2020-10-22 02:22:21,991 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:21,991 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870513263] [2020-10-22 02:22:21,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-22 02:22:22,219 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:22:22,219 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870513263] [2020-10-22 02:22:22,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-22 02:22:22,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-22 02:22:22,220 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [865982861] [2020-10-22 02:22:22,221 INFO L194 McrAutomatonBuilder]: Constructing automaton for MCR equivalence class. [2020-10-22 02:22:22,226 INFO L249 McrAutomatonBuilder]: Started intersection. [2020-10-22 02:22:22,276 INFO L252 McrAutomatonBuilder]: Finished intersection with 53 states and 85 transitions. [2020-10-22 02:22:22,276 INFO L276 McrAutomatonBuilder]: Constructing interpolant automaton by labelling MCR automaton with interpolants from WpInterpolantProvider [2020-10-22 02:22:22,338 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,339 INFO L603 QuantifierPusher]: Distributing 4 disjuncts over 2 conjuncts [2020-10-22 02:22:22,341 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:22:22,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,350 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:22:22,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,352 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-22 02:22:22,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,354 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 5, 2, 3, 2, 1] term [2020-10-22 02:22:22,354 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,356 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,365 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,372 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:22,375 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,380 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:22,387 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,388 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:22,391 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:22,397 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:22:22,404 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:22,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,418 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,423 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:22,426 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:22,431 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:22:22,435 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:22,440 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,445 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,450 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,451 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:22:22,455 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,458 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:22:22,463 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,468 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 5, 2, 3, 2, 1] term [2020-10-22 02:22:22,468 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,471 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,472 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:22,476 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,480 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:22,488 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:22,490 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:22,501 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,503 INFO L603 QuantifierPusher]: Distributing 5 disjuncts over 4 conjuncts [2020-10-22 02:22:22,508 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:22,514 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,521 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,524 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,736 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 29 [2020-10-22 02:22:22,912 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 97 [2020-10-22 02:22:22,926 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,927 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,940 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:22:22,941 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,942 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:22:22,942 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,944 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-22 02:22:22,944 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,945 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-22 02:22:22,946 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,947 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:22,949 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,950 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,954 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,963 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:22,964 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,971 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,979 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,981 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,982 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:22,988 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 2, 4, 1] term [2020-10-22 02:22:22,988 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,990 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:22,990 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:22,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,994 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:22,996 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,003 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:23,004 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,005 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,008 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,014 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:23,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,015 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,017 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,024 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:23,025 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,026 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,029 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,042 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,043 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,325 WARN L193 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 97 [2020-10-22 02:22:23,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,345 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,347 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:22:23,347 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,349 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:22:23,349 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,350 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-22 02:22:23,350 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,351 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 2, 4, 1] term [2020-10-22 02:22:23,351 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,352 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,357 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,361 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,367 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,368 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:23,369 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,370 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,371 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,388 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:23,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,389 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,392 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,399 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:23,399 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,400 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,401 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,409 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:23,410 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,411 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,413 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,420 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-22 02:22:23,420 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,421 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:23,422 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,423 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,424 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,434 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:23,435 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,436 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,439 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,446 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,447 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,448 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,622 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 97 [2020-10-22 02:22:23,636 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,637 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,639 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 3, 3, 2, 1] term [2020-10-22 02:22:23,639 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,640 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 3, 2, 2, 1] term [2020-10-22 02:22:23,640 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,641 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[6, 4, 4, 2, 3, 2, 1] term [2020-10-22 02:22:23,641 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,642 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 2, 3, 4, 2, 4, 1] term [2020-10-22 02:22:23,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,643 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,648 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,650 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,651 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,666 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,667 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,667 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:22:23,671 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,674 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:22:23,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,682 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,684 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:23,685 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,686 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:23,689 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,693 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 4 conjuncts [2020-10-22 02:22:23,702 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,702 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:22:23,706 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,709 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-22 02:22:23,713 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,716 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[3, 3, 3, 4, 2, 4, 1] term [2020-10-22 02:22:23,717 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-22 02:22:23,719 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,720 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,721 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,725 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-22 02:22:23,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,727 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-22 02:22:23,729 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,736 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 5 conjuncts [2020-10-22 02:22:23,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,737 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,740 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 4 conjuncts [2020-10-22 02:22:23,774 INFO L301 McrAutomatonBuilder]: Construction finished. MCR generated 1 new interpolants: [5642#(and (or (and (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y$r_buff0_thd2~0 0)) (and (not (= 0 (mod ~y$r_buff0_thd3~0 256))) (not (= (mod ~y$w_buff0_used~0 256) 0)))) (or (= (mod ~y$w_buff0_used~0 256) 0) (and (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y$w_buff0~0 1) (< 0 (+ (div ~y$w_buff1_used~0 256) 1)) (= ~y$r_buff0_thd2~0 0)) (= 0 (mod ~y$r_buff0_thd3~0 256))))] [2020-10-22 02:22:23,774 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-22 02:22:23,774 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-22 02:22:23,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-22 02:22:23,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-22 02:22:23,775 INFO L87 Difference]: Start difference. First operand 41 states and 67 transitions. Second operand 7 states. [2020-10-22 02:22:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-22 02:22:23,978 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2020-10-22 02:22:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-22 02:22:23,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2020-10-22 02:22:23,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-22 02:22:23,980 INFO L225 Difference]: With dead ends: 51 [2020-10-22 02:22:23,980 INFO L226 Difference]: Without dead ends: 29 [2020-10-22 02:22:23,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-10-22 02:22:23,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-22 02:22:23,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-22 02:22:23,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-22 02:22:23,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2020-10-22 02:22:23,982 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 19 [2020-10-22 02:22:23,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-22 02:22:23,983 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2020-10-22 02:22:23,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-22 02:22:23,983 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2020-10-22 02:22:23,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-22 02:22:23,983 INFO L414 BasicCegarLoop]: Found error trace [2020-10-22 02:22:23,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-22 02:22:23,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-22 02:22:23,984 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-22 02:22:23,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-22 02:22:23,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1519103564, now seen corresponding path program 4 times [2020-10-22 02:22:23,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-22 02:22:23,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978535300] [2020-10-22 02:22:23,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-22 02:22:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:22:24,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:22:24,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-22 02:22:24,213 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-22 02:22:24,290 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-22 02:22:24,291 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-22 02:22:24,291 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-22 02:22:24,292 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-22 02:22:24,327 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L835-->L843: Formula: (let ((.cse6 (= (mod ~y$r_buff0_thd0~0_In-148876344 256) 0)) (.cse7 (= (mod ~y$w_buff0_used~0_In-148876344 256) 0)) (.cse9 (= (mod ~y$w_buff1_used~0_In-148876344 256) 0)) (.cse8 (= (mod ~y$r_buff1_thd0~0_In-148876344 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse3 (not .cse7)) (.cse4 (not .cse6)) (.cse5 (or .cse6 .cse7))) (and (or (and .cse0 (= ~y$w_buff1_used~0_Out-148876344 0) .cse1) (and (= ~y$w_buff1_used~0_Out-148876344 ~y$w_buff1_used~0_In-148876344) .cse2)) (or (and .cse3 .cse4 (= ~y~0_Out-148876344 ~y$w_buff0~0_In-148876344)) (and .cse5 (or (and (= ~y~0_Out-148876344 ~y~0_In-148876344) .cse2) (and .cse0 .cse1 (= ~y~0_Out-148876344 ~y$w_buff1~0_In-148876344))))) (or (and .cse3 .cse4 (= ~y$w_buff0_used~0_Out-148876344 0)) (and .cse5 (= ~y$w_buff0_used~0_Out-148876344 ~y$w_buff0_used~0_In-148876344))) (= ~y$r_buff0_thd0~0_In-148876344 ~y$r_buff0_thd0~0_Out-148876344) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-148876344 0)) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-148876344| ULTIMATE.start_assume_abort_if_not_~cond_Out-148876344) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_Out-148876344| (mod ~main$tmp_guard0~0_In-148876344 256)) (= ~y$r_buff1_thd0~0_Out-148876344 ~y$r_buff1_thd0~0_In-148876344)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-148876344, ~y$w_buff1~0=~y$w_buff1~0_In-148876344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-148876344, ~y$w_buff0~0=~y$w_buff0~0_In-148876344, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-148876344, ~y~0=~y~0_In-148876344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-148876344, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-148876344} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out-148876344, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-148876344|, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-148876344|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-148876344|, ~main$tmp_guard0~0=~main$tmp_guard0~0_In-148876344, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-148876344|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_Out-148876344|, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-148876344|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-148876344|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-148876344, ~y$w_buff1~0=~y$w_buff1~0_In-148876344, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_Out-148876344, ~y$w_buff0~0=~y$w_buff0~0_In-148876344, ~y~0=~y~0_Out-148876344, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-148876344, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out-148876344} AuxVars[] AssignedVars[~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_assume_abort_if_not_#in~cond, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0] because there is no mapped edge [2020-10-22 02:22:24,343 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:22:24,343 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [789] [2020-10-22 02:22:24,346 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:22:24,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,347 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:22:24,347 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,347 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:22:24,348 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,349 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:22:24,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,349 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:22:24,349 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,350 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:22:24,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,350 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:22:24,350 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,351 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:22:24,351 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,352 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:22:24,352 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,352 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:22:24,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,353 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:22:24,353 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,354 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:22:24,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,354 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:22:24,354 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,354 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:22:24,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,355 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:22:24,355 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,356 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:22:24,356 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,358 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:22:24,359 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,365 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:22:24,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,366 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:22:24,366 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-22 02:22:24,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 02:22:24 BasicIcfg [2020-10-22 02:22:24,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-22 02:22:24,457 INFO L168 Benchmark]: Toolchain (without parser) took 13538.38 ms. Allocated memory was 146.3 MB in the beginning and 369.1 MB in the end (delta: 222.8 MB). Free memory was 101.1 MB in the beginning and 299.2 MB in the end (delta: -198.1 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2020-10-22 02:22:24,458 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-10-22 02:22:24,459 INFO L168 Benchmark]: CACSL2BoogieTranslator took 775.74 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2020-10-22 02:22:24,460 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.55 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.7 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:22:24,461 INFO L168 Benchmark]: Boogie Preprocessor took 41.83 ms. Allocated memory is still 203.9 MB. Free memory was 152.7 MB in the beginning and 150.0 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:22:24,462 INFO L168 Benchmark]: RCFGBuilder took 1813.43 ms. Allocated memory was 203.9 MB in the beginning and 248.5 MB in the end (delta: 44.6 MB). Free memory was 150.0 MB in the beginning and 214.2 MB in the end (delta: -64.3 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. [2020-10-22 02:22:24,463 INFO L168 Benchmark]: TraceAbstraction took 10835.21 ms. Allocated memory was 248.5 MB in the beginning and 369.1 MB in the end (delta: 120.6 MB). Free memory was 214.2 MB in the beginning and 299.2 MB in the end (delta: -85.0 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. [2020-10-22 02:22:24,467 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 146.3 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 775.74 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.5 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.55 ms. Allocated memory is still 203.9 MB. Free memory was 155.5 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.83 ms. Allocated memory is still 203.9 MB. Free memory was 152.7 MB in the beginning and 150.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1813.43 ms. Allocated memory was 203.9 MB in the beginning and 248.5 MB in the end (delta: 44.6 MB). Free memory was 150.0 MB in the beginning and 214.2 MB in the end (delta: -64.3 MB). Peak memory consumption was 102.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10835.21 ms. Allocated memory was 248.5 MB in the beginning and 369.1 MB in the end (delta: 120.6 MB). Free memory was 214.2 MB in the beginning and 299.2 MB in the end (delta: -85.0 MB). Peak memory consumption was 35.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 877 VarBasedMoverChecksPositive, 25 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 57 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 3.1s, 107 PlacesBefore, 34 PlacesAfterwards, 100 TransitionsBefore, 24 TransitionsAfterwards, 1648 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 3 ChoiceCompositions, 94 TotalNumberOfCompositions, 3809 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L827] 0 pthread_t t2586; [L828] FCALL, FORK 0 pthread_create(&t2586, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L829] 0 pthread_t t2587; [L830] FCALL, FORK 0 pthread_create(&t2587, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L831] 0 pthread_t t2588; [L832] FCALL, FORK 0 pthread_create(&t2588, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] 3 y$w_buff1 = y$w_buff0 [L791] 3 y$w_buff0 = 1 [L792] 3 y$w_buff1_used = y$w_buff0_used [L793] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L795] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L796] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L797] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L798] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L799] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L755] 1 return 0; [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 y$flush_delayed = weak$$choice2 [L768] 2 y$mem_tmp = y [L769] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 [L769] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L769] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L770] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L770] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L771] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L771] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1) [L771] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L771] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L772] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used) [L772] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L772] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0 [L773] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L773] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L774] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L775] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EAX = y [L777] EXPR 2 y$flush_delayed ? y$mem_tmp : y [L777] 2 y = y$flush_delayed ? y$mem_tmp : y [L778] 2 y$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L805] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L805] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L806] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L806] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L807] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L807] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L808] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L808] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L809] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L812] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L814] 3 return 0; [L834] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L845] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe034_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.5s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 159 SDtfs, 206 SDslu, 224 SDs, 0 SdLazy, 86 SolverSat, 50 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=522occurred 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, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 6862 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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...