/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/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:22:53,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:22:53,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:22:53,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:22:53,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:22:53,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:22:53,656 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:22:53,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:22:53,659 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:22:53,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:22:53,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:22:53,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:22:53,662 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:22:53,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:22:53,664 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:22:53,665 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:22:53,666 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:22:53,667 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:22:53,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:22:53,671 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:22:53,672 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:22:53,673 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:22:53,674 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:22:53,675 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:22:53,677 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:22:53,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:22:53,678 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:22:53,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:22:53,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:22:53,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:22:53,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:22:53,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:22:53,682 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:22:53,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:22:53,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:22:53,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:22:53,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:22:53,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:22:53,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:22:53,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:22:53,686 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:22:53,687 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:22:53,707 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:22:53,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:22:53,708 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:22:53,710 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:22:53,710 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:22:53,710 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:22:53,710 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:22:53,711 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:22:53,711 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:22:53,711 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:22:53,712 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:22:53,712 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:22:53,712 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:22:53,713 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:22:53,713 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:22:53,713 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:22:53,713 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:22:53,714 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:22:53,714 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:22:53,714 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:22:53,714 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:22:53,715 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:22:53,715 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:22:53,715 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:22:53,715 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:22:53,715 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:22:53,716 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:22:53,716 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:22:53,716 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:22:53,716 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:22:53,717 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:22:53,980 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:22:53,996 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:22:54,000 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:22:54,001 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:22:54,002 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:22:54,003 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-27 18:22:54,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5e29b05/ebc16c23b495421bb98a0b855bf4cca3/FLAGaa8d6bb8b [2019-12-27 18:22:54,693 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:22:54,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.oepc.i [2019-12-27 18:22:54,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5e29b05/ebc16c23b495421bb98a0b855bf4cca3/FLAGaa8d6bb8b [2019-12-27 18:22:54,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5e29b05/ebc16c23b495421bb98a0b855bf4cca3 [2019-12-27 18:22:54,930 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:22:54,932 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:22:54,933 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:22:54,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:22:54,935 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:22:54,936 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:22:54" (1/1) ... [2019-12-27 18:22:54,939 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d1b0b36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:54, skipping insertion in model container [2019-12-27 18:22:54,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:22:54" (1/1) ... [2019-12-27 18:22:54,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:22:55,014 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:22:55,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:22:55,578 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:22:55,661 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:22:55,737 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:22:55,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55 WrapperNode [2019-12-27 18:22:55,737 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:22:55,738 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:22:55,738 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:22:55,739 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:22:55,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,766 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:22:55,803 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:22:55,803 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:22:55,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:22:55,813 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (1/1) ... [2019-12-27 18:22:55,842 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:22:55,843 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:22:55,843 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:22:55,843 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:22:55,844 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (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 [2019-12-27 18:22:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:22:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:22:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:22:55,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:22:55,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:22:55,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:22:55,921 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:22:55,921 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:22:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:22:55,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:22:55,922 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:22:55,924 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:22:56,790 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:22:56,790 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:22:56,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:22:56 BoogieIcfgContainer [2019-12-27 18:22:56,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:22:56,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:22:56,793 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:22:56,796 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:22:56,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:22:54" (1/3) ... [2019-12-27 18:22:56,797 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c12acbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:22:56, skipping insertion in model container [2019-12-27 18:22:56,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:22:55" (2/3) ... [2019-12-27 18:22:56,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c12acbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:22:56, skipping insertion in model container [2019-12-27 18:22:56,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:22:56" (3/3) ... [2019-12-27 18:22:56,800 INFO L109 eAbstractionObserver]: Analyzing ICFG safe017_pso.oepc.i [2019-12-27 18:22:56,810 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:22:56,810 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:22:56,817 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:22:56,818 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:22:56,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,856 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,867 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,890 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,891 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,892 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,893 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,894 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,895 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,902 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,903 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,904 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,904 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,910 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,911 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,911 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,912 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,913 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,916 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,916 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:22:56,933 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:22:56,952 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:22:56,952 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:22:56,952 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:22:56,952 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:22:56,953 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:22:56,953 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:22:56,953 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:22:56,953 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:22:56,977 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 173 places, 210 transitions [2019-12-27 18:22:56,979 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 18:22:57,094 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 18:22:57,095 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:22:57,110 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:22:57,132 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 173 places, 210 transitions [2019-12-27 18:22:57,185 INFO L132 PetriNetUnfolder]: 47/207 cut-off events. [2019-12-27 18:22:57,186 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:22:57,193 INFO L76 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 207 events. 47/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 0/158 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:22:57,214 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-27 18:22:57,215 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:23:02,383 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 18:23:02,506 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 18:23:02,534 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78185 [2019-12-27 18:23:02,534 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-27 18:23:02,538 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 104 transitions [2019-12-27 18:23:18,814 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 112926 states. [2019-12-27 18:23:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 112926 states. [2019-12-27 18:23:18,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 18:23:18,821 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:23:18,822 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 18:23:18,822 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:23:18,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:23:18,827 INFO L82 PathProgramCache]: Analyzing trace with hash 844394, now seen corresponding path program 1 times [2019-12-27 18:23:18,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:23:18,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368901992] [2019-12-27 18:23:18,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:23:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:23:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:23:19,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368901992] [2019-12-27 18:23:19,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:23:19,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:23:19,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995608281] [2019-12-27 18:23:19,067 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:23:19,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:23:19,084 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 18:23:19,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:23:19,090 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:23:19,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:23:19,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:23:19,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:23:19,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:23:19,108 INFO L87 Difference]: Start difference. First operand 112926 states. Second operand 3 states. [2019-12-27 18:23:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:23:23,086 INFO L93 Difference]: Finished difference Result 112536 states and 479624 transitions. [2019-12-27 18:23:23,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:23:23,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 18:23:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:23:24,014 INFO L225 Difference]: With dead ends: 112536 [2019-12-27 18:23:24,014 INFO L226 Difference]: Without dead ends: 110184 [2019-12-27 18:23:24,016 INFO L631 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 [2019-12-27 18:23:28,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110184 states. [2019-12-27 18:23:30,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110184 to 110184. [2019-12-27 18:23:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110184 states. [2019-12-27 18:23:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110184 states to 110184 states and 470020 transitions. [2019-12-27 18:23:36,206 INFO L78 Accepts]: Start accepts. Automaton has 110184 states and 470020 transitions. Word has length 3 [2019-12-27 18:23:36,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:23:36,206 INFO L462 AbstractCegarLoop]: Abstraction has 110184 states and 470020 transitions. [2019-12-27 18:23:36,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:23:36,207 INFO L276 IsEmpty]: Start isEmpty. Operand 110184 states and 470020 transitions. [2019-12-27 18:23:36,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:23:36,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:23:36,219 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:23:36,220 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:23:36,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:23:36,220 INFO L82 PathProgramCache]: Analyzing trace with hash -418531443, now seen corresponding path program 1 times [2019-12-27 18:23:36,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:23:36,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748013148] [2019-12-27 18:23:36,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:23:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:23:36,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:23:36,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748013148] [2019-12-27 18:23:36,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:23:36,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:23:36,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1171087006] [2019-12-27 18:23:36,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:23:36,364 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:23:36,368 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:23:36,368 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:23:36,368 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:23:36,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:23:36,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:23:36,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:23:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:23:36,370 INFO L87 Difference]: Start difference. First operand 110184 states and 470020 transitions. Second operand 4 states. [2019-12-27 18:23:37,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:23:37,608 INFO L93 Difference]: Finished difference Result 172298 states and 706272 transitions. [2019-12-27 18:23:37,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:23:37,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 18:23:37,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:23:42,948 INFO L225 Difference]: With dead ends: 172298 [2019-12-27 18:23:42,949 INFO L226 Difference]: Without dead ends: 172249 [2019-12-27 18:23:42,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:23:47,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172249 states. [2019-12-27 18:23:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172249 to 156321. [2019-12-27 18:23:50,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156321 states. [2019-12-27 18:23:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156321 states to 156321 states and 647667 transitions. [2019-12-27 18:23:57,619 INFO L78 Accepts]: Start accepts. Automaton has 156321 states and 647667 transitions. Word has length 11 [2019-12-27 18:23:57,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:23:57,619 INFO L462 AbstractCegarLoop]: Abstraction has 156321 states and 647667 transitions. [2019-12-27 18:23:57,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:23:57,619 INFO L276 IsEmpty]: Start isEmpty. Operand 156321 states and 647667 transitions. [2019-12-27 18:23:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:23:57,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:23:57,624 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:23:57,624 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:23:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:23:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash -986312255, now seen corresponding path program 1 times [2019-12-27 18:23:57,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:23:57,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114472678] [2019-12-27 18:23:57,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:23:57,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:23:57,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:23:57,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114472678] [2019-12-27 18:23:57,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:23:57,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:23:57,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990846715] [2019-12-27 18:23:57,704 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:23:57,705 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:23:57,707 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:23:57,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:23:57,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:23:57,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:23:57,708 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:23:57,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:23:57,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:23:57,708 INFO L87 Difference]: Start difference. First operand 156321 states and 647667 transitions. Second operand 3 states. [2019-12-27 18:23:57,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:23:57,843 INFO L93 Difference]: Finished difference Result 32129 states and 104196 transitions. [2019-12-27 18:23:57,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:23:57,844 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:23:57,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:23:57,930 INFO L225 Difference]: With dead ends: 32129 [2019-12-27 18:23:57,930 INFO L226 Difference]: Without dead ends: 32129 [2019-12-27 18:23:57,931 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:23:58,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32129 states. [2019-12-27 18:23:58,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32129 to 32129. [2019-12-27 18:23:58,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32129 states. [2019-12-27 18:23:58,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32129 states to 32129 states and 104196 transitions. [2019-12-27 18:23:58,538 INFO L78 Accepts]: Start accepts. Automaton has 32129 states and 104196 transitions. Word has length 13 [2019-12-27 18:23:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:23:58,538 INFO L462 AbstractCegarLoop]: Abstraction has 32129 states and 104196 transitions. [2019-12-27 18:23:58,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:23:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32129 states and 104196 transitions. [2019-12-27 18:23:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:23:58,540 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:23:58,540 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:23:58,540 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:23:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:23:58,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1176456771, now seen corresponding path program 1 times [2019-12-27 18:23:58,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:23:58,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264854815] [2019-12-27 18:23:58,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:23:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:23:58,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:23:58,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264854815] [2019-12-27 18:23:58,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:23:58,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:23:58,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [334863269] [2019-12-27 18:23:58,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:23:58,654 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:23:58,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:23:58,655 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:23:58,655 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:23:58,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:23:58,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:23:58,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:23:58,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:23:58,656 INFO L87 Difference]: Start difference. First operand 32129 states and 104196 transitions. Second operand 4 states. [2019-12-27 18:23:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:23:59,056 INFO L93 Difference]: Finished difference Result 43159 states and 136814 transitions. [2019-12-27 18:23:59,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:23:59,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:23:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:23:59,144 INFO L225 Difference]: With dead ends: 43159 [2019-12-27 18:23:59,144 INFO L226 Difference]: Without dead ends: 43152 [2019-12-27 18:23:59,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:23:59,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43152 states. [2019-12-27 18:24:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43152 to 37631. [2019-12-27 18:24:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37631 states. [2019-12-27 18:24:00,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37631 states to 37631 states and 121166 transitions. [2019-12-27 18:24:00,955 INFO L78 Accepts]: Start accepts. Automaton has 37631 states and 121166 transitions. Word has length 13 [2019-12-27 18:24:00,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:00,955 INFO L462 AbstractCegarLoop]: Abstraction has 37631 states and 121166 transitions. [2019-12-27 18:24:00,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:24:00,956 INFO L276 IsEmpty]: Start isEmpty. Operand 37631 states and 121166 transitions. [2019-12-27 18:24:00,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:24:00,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:00,959 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:00,960 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:00,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:00,960 INFO L82 PathProgramCache]: Analyzing trace with hash -2012510844, now seen corresponding path program 1 times [2019-12-27 18:24:00,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:00,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809357458] [2019-12-27 18:24:00,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:01,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809357458] [2019-12-27 18:24:01,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:01,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:24:01,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2007850830] [2019-12-27 18:24:01,044 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:01,046 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:01,051 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 48 transitions. [2019-12-27 18:24:01,051 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:01,091 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:24:01,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:24:01,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:01,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:24:01,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:24:01,092 INFO L87 Difference]: Start difference. First operand 37631 states and 121166 transitions. Second operand 6 states. [2019-12-27 18:24:01,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:01,881 INFO L93 Difference]: Finished difference Result 50788 states and 160280 transitions. [2019-12-27 18:24:01,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:24:01,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 18:24:01,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:01,985 INFO L225 Difference]: With dead ends: 50788 [2019-12-27 18:24:01,985 INFO L226 Difference]: Without dead ends: 50775 [2019-12-27 18:24:01,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:24:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50775 states. [2019-12-27 18:24:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50775 to 38059. [2019-12-27 18:24:03,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38059 states. [2019-12-27 18:24:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38059 states to 38059 states and 122380 transitions. [2019-12-27 18:24:03,484 INFO L78 Accepts]: Start accepts. Automaton has 38059 states and 122380 transitions. Word has length 19 [2019-12-27 18:24:03,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:03,484 INFO L462 AbstractCegarLoop]: Abstraction has 38059 states and 122380 transitions. [2019-12-27 18:24:03,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:24:03,485 INFO L276 IsEmpty]: Start isEmpty. Operand 38059 states and 122380 transitions. [2019-12-27 18:24:03,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:24:03,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:03,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:03,499 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:03,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:03,499 INFO L82 PathProgramCache]: Analyzing trace with hash -394195806, now seen corresponding path program 1 times [2019-12-27 18:24:03,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:03,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78723360] [2019-12-27 18:24:03,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:03,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78723360] [2019-12-27 18:24:03,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:03,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:24:03,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1152413594] [2019-12-27 18:24:03,593 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:03,597 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:03,607 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 18:24:03,607 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:03,628 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:24:03,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:24:03,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:03,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:24:03,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:24:03,629 INFO L87 Difference]: Start difference. First operand 38059 states and 122380 transitions. Second operand 5 states. [2019-12-27 18:24:03,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:03,686 INFO L93 Difference]: Finished difference Result 7382 states and 20162 transitions. [2019-12-27 18:24:03,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:24:03,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 18:24:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:03,698 INFO L225 Difference]: With dead ends: 7382 [2019-12-27 18:24:03,698 INFO L226 Difference]: Without dead ends: 7382 [2019-12-27 18:24:03,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:24:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2019-12-27 18:24:03,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7270. [2019-12-27 18:24:03,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7270 states. [2019-12-27 18:24:03,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7270 states to 7270 states and 19842 transitions. [2019-12-27 18:24:03,798 INFO L78 Accepts]: Start accepts. Automaton has 7270 states and 19842 transitions. Word has length 25 [2019-12-27 18:24:03,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:03,798 INFO L462 AbstractCegarLoop]: Abstraction has 7270 states and 19842 transitions. [2019-12-27 18:24:03,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:24:03,799 INFO L276 IsEmpty]: Start isEmpty. Operand 7270 states and 19842 transitions. [2019-12-27 18:24:03,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:24:03,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:03,810 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:03,811 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:03,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:03,811 INFO L82 PathProgramCache]: Analyzing trace with hash 56145512, now seen corresponding path program 1 times [2019-12-27 18:24:03,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:03,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592332096] [2019-12-27 18:24:03,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:03,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592332096] [2019-12-27 18:24:03,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:03,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:24:03,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810703715] [2019-12-27 18:24:03,893 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:03,900 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:03,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 95 states and 150 transitions. [2019-12-27 18:24:03,935 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:03,956 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:24:03,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:24:03,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:24:03,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:24:03,957 INFO L87 Difference]: Start difference. First operand 7270 states and 19842 transitions. Second operand 6 states. [2019-12-27 18:24:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:04,007 INFO L93 Difference]: Finished difference Result 5311 states and 15265 transitions. [2019-12-27 18:24:04,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:24:04,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-27 18:24:04,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:04,016 INFO L225 Difference]: With dead ends: 5311 [2019-12-27 18:24:04,016 INFO L226 Difference]: Without dead ends: 5311 [2019-12-27 18:24:04,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:24:04,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5311 states. [2019-12-27 18:24:04,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5311 to 4947. [2019-12-27 18:24:04,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4947 states. [2019-12-27 18:24:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4947 states to 4947 states and 14281 transitions. [2019-12-27 18:24:04,092 INFO L78 Accepts]: Start accepts. Automaton has 4947 states and 14281 transitions. Word has length 37 [2019-12-27 18:24:04,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:04,093 INFO L462 AbstractCegarLoop]: Abstraction has 4947 states and 14281 transitions. [2019-12-27 18:24:04,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:24:04,093 INFO L276 IsEmpty]: Start isEmpty. Operand 4947 states and 14281 transitions. [2019-12-27 18:24:04,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:24:04,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:04,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:04,101 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:04,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:04,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1380306829, now seen corresponding path program 1 times [2019-12-27 18:24:04,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:04,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337932605] [2019-12-27 18:24:04,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:04,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:04,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337932605] [2019-12-27 18:24:04,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:04,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:24:04,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [818757774] [2019-12-27 18:24:04,178 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:04,200 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:04,373 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 18:24:04,374 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:04,375 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:24:04,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:24:04,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:04,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:24:04,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:24:04,377 INFO L87 Difference]: Start difference. First operand 4947 states and 14281 transitions. Second operand 3 states. [2019-12-27 18:24:04,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:04,439 INFO L93 Difference]: Finished difference Result 4958 states and 14296 transitions. [2019-12-27 18:24:04,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:24:04,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:24:04,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:04,448 INFO L225 Difference]: With dead ends: 4958 [2019-12-27 18:24:04,448 INFO L226 Difference]: Without dead ends: 4958 [2019-12-27 18:24:04,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:24:04,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2019-12-27 18:24:04,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4954. [2019-12-27 18:24:04,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4954 states. [2019-12-27 18:24:04,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4954 states to 4954 states and 14292 transitions. [2019-12-27 18:24:04,515 INFO L78 Accepts]: Start accepts. Automaton has 4954 states and 14292 transitions. Word has length 65 [2019-12-27 18:24:04,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:04,516 INFO L462 AbstractCegarLoop]: Abstraction has 4954 states and 14292 transitions. [2019-12-27 18:24:04,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:24:04,517 INFO L276 IsEmpty]: Start isEmpty. Operand 4954 states and 14292 transitions. [2019-12-27 18:24:04,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:24:04,524 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:04,524 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:04,524 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:04,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:04,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1838424094, now seen corresponding path program 1 times [2019-12-27 18:24:04,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:04,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218678755] [2019-12-27 18:24:04,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:04,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:04,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218678755] [2019-12-27 18:24:04,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:04,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:24:04,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1719433755] [2019-12-27 18:24:04,652 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:04,672 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:05,215 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 273 states and 532 transitions. [2019-12-27 18:24:05,215 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:05,344 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 18:24:05,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:24:05,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:05,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:24:05,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:24:05,346 INFO L87 Difference]: Start difference. First operand 4954 states and 14292 transitions. Second operand 9 states. [2019-12-27 18:24:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:05,747 INFO L93 Difference]: Finished difference Result 7545 states and 21557 transitions. [2019-12-27 18:24:05,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:24:05,748 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 18:24:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:05,759 INFO L225 Difference]: With dead ends: 7545 [2019-12-27 18:24:05,759 INFO L226 Difference]: Without dead ends: 7545 [2019-12-27 18:24:05,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:24:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7545 states. [2019-12-27 18:24:05,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7545 to 6351. [2019-12-27 18:24:05,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6351 states. [2019-12-27 18:24:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6351 states to 6351 states and 18327 transitions. [2019-12-27 18:24:05,854 INFO L78 Accepts]: Start accepts. Automaton has 6351 states and 18327 transitions. Word has length 65 [2019-12-27 18:24:05,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:05,854 INFO L462 AbstractCegarLoop]: Abstraction has 6351 states and 18327 transitions. [2019-12-27 18:24:05,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:24:05,854 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states and 18327 transitions. [2019-12-27 18:24:05,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:24:05,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:05,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:05,864 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:05,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1320159464, now seen corresponding path program 2 times [2019-12-27 18:24:05,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:05,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999414266] [2019-12-27 18:24:05,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:05,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999414266] [2019-12-27 18:24:05,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:05,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:24:05,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1568668908] [2019-12-27 18:24:05,985 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:06,013 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:06,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 299 states and 558 transitions. [2019-12-27 18:24:06,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:06,502 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 18:24:06,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:24:06,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:06,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:24:06,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:24:06,503 INFO L87 Difference]: Start difference. First operand 6351 states and 18327 transitions. Second operand 14 states. [2019-12-27 18:24:08,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:08,734 INFO L93 Difference]: Finished difference Result 15413 states and 43639 transitions. [2019-12-27 18:24:08,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:24:08,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 18:24:08,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:08,754 INFO L225 Difference]: With dead ends: 15413 [2019-12-27 18:24:08,755 INFO L226 Difference]: Without dead ends: 15413 [2019-12-27 18:24:08,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 20 SyntacticMatches, 7 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=395, Unknown=0, NotChecked=0, Total=552 [2019-12-27 18:24:08,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15413 states. [2019-12-27 18:24:08,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15413 to 7034. [2019-12-27 18:24:08,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7034 states. [2019-12-27 18:24:08,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7034 states to 7034 states and 20386 transitions. [2019-12-27 18:24:08,929 INFO L78 Accepts]: Start accepts. Automaton has 7034 states and 20386 transitions. Word has length 65 [2019-12-27 18:24:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:08,930 INFO L462 AbstractCegarLoop]: Abstraction has 7034 states and 20386 transitions. [2019-12-27 18:24:08,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:24:08,930 INFO L276 IsEmpty]: Start isEmpty. Operand 7034 states and 20386 transitions. [2019-12-27 18:24:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:24:08,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:08,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:08,945 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:08,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:08,946 INFO L82 PathProgramCache]: Analyzing trace with hash -518212600, now seen corresponding path program 3 times [2019-12-27 18:24:08,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:08,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478639886] [2019-12-27 18:24:08,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:09,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:09,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478639886] [2019-12-27 18:24:09,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:09,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 18:24:09,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103626553] [2019-12-27 18:24:09,113 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:09,147 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:09,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 281 states and 540 transitions. [2019-12-27 18:24:09,350 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:09,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:24:09,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 18:24:09,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:09,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 18:24:09,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:24:09,632 INFO L87 Difference]: Start difference. First operand 7034 states and 20386 transitions. Second operand 14 states. [2019-12-27 18:24:12,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:12,538 INFO L93 Difference]: Finished difference Result 14619 states and 41486 transitions. [2019-12-27 18:24:12,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:24:12,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 65 [2019-12-27 18:24:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:12,558 INFO L225 Difference]: With dead ends: 14619 [2019-12-27 18:24:12,558 INFO L226 Difference]: Without dead ends: 14619 [2019-12-27 18:24:12,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=371, Invalid=1111, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 18:24:12,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14619 states. [2019-12-27 18:24:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14619 to 6638. [2019-12-27 18:24:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6638 states. [2019-12-27 18:24:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6638 states to 6638 states and 19223 transitions. [2019-12-27 18:24:12,723 INFO L78 Accepts]: Start accepts. Automaton has 6638 states and 19223 transitions. Word has length 65 [2019-12-27 18:24:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:12,723 INFO L462 AbstractCegarLoop]: Abstraction has 6638 states and 19223 transitions. [2019-12-27 18:24:12,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 18:24:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand 6638 states and 19223 transitions. [2019-12-27 18:24:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:24:12,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:12,732 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:12,733 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:12,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:12,733 INFO L82 PathProgramCache]: Analyzing trace with hash -61468540, now seen corresponding path program 4 times [2019-12-27 18:24:12,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:12,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309214101] [2019-12-27 18:24:12,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:13,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:13,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309214101] [2019-12-27 18:24:13,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:13,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:24:13,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1720062244] [2019-12-27 18:24:13,221 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:13,245 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:13,480 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 251 states and 488 transitions. [2019-12-27 18:24:13,481 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:13,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 18:24:13,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:24:13,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:13,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:24:13,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:24:13,598 INFO L87 Difference]: Start difference. First operand 6638 states and 19223 transitions. Second operand 9 states. [2019-12-27 18:24:14,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:14,251 INFO L93 Difference]: Finished difference Result 9302 states and 26441 transitions. [2019-12-27 18:24:14,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 18:24:14,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 18:24:14,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:14,264 INFO L225 Difference]: With dead ends: 9302 [2019-12-27 18:24:14,264 INFO L226 Difference]: Without dead ends: 9302 [2019-12-27 18:24:14,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-27 18:24:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9302 states. [2019-12-27 18:24:14,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9302 to 6895. [2019-12-27 18:24:14,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6895 states. [2019-12-27 18:24:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6895 states to 6895 states and 19967 transitions. [2019-12-27 18:24:14,369 INFO L78 Accepts]: Start accepts. Automaton has 6895 states and 19967 transitions. Word has length 65 [2019-12-27 18:24:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:14,369 INFO L462 AbstractCegarLoop]: Abstraction has 6895 states and 19967 transitions. [2019-12-27 18:24:14,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:24:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 6895 states and 19967 transitions. [2019-12-27 18:24:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:24:14,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:14,378 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:14,378 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:14,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:14,378 INFO L82 PathProgramCache]: Analyzing trace with hash 49095600, now seen corresponding path program 5 times [2019-12-27 18:24:14,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:14,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077504491] [2019-12-27 18:24:14,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:14,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077504491] [2019-12-27 18:24:14,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:14,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:24:14,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1008838829] [2019-12-27 18:24:14,491 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:14,508 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:14,784 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 274 states and 533 transitions. [2019-12-27 18:24:14,784 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:15,009 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:24:15,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:24:15,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:15,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:24:15,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:24:15,011 INFO L87 Difference]: Start difference. First operand 6895 states and 19967 transitions. Second operand 13 states. [2019-12-27 18:24:16,902 WARN L192 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-12-27 18:24:18,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:18,273 INFO L93 Difference]: Finished difference Result 21866 states and 62447 transitions. [2019-12-27 18:24:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-27 18:24:18,273 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 65 [2019-12-27 18:24:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:18,300 INFO L225 Difference]: With dead ends: 21866 [2019-12-27 18:24:18,300 INFO L226 Difference]: Without dead ends: 21866 [2019-12-27 18:24:18,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=569, Invalid=1593, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 18:24:18,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21866 states. [2019-12-27 18:24:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21866 to 7396. [2019-12-27 18:24:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7396 states. [2019-12-27 18:24:18,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7396 states to 7396 states and 21520 transitions. [2019-12-27 18:24:18,508 INFO L78 Accepts]: Start accepts. Automaton has 7396 states and 21520 transitions. Word has length 65 [2019-12-27 18:24:18,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:18,508 INFO L462 AbstractCegarLoop]: Abstraction has 7396 states and 21520 transitions. [2019-12-27 18:24:18,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:24:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 7396 states and 21520 transitions. [2019-12-27 18:24:18,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:24:18,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:18,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:18,519 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:18,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:18,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1715239754, now seen corresponding path program 6 times [2019-12-27 18:24:18,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:18,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82789309] [2019-12-27 18:24:18,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:18,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:18,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82789309] [2019-12-27 18:24:18,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:18,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:24:18,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1935373737] [2019-12-27 18:24:18,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:18,627 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:18,899 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 258 states and 482 transitions. [2019-12-27 18:24:18,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:18,901 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:24:18,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:24:18,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:18,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:24:18,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:24:18,902 INFO L87 Difference]: Start difference. First operand 7396 states and 21520 transitions. Second operand 3 states. [2019-12-27 18:24:18,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:18,991 INFO L93 Difference]: Finished difference Result 7396 states and 21519 transitions. [2019-12-27 18:24:18,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:24:18,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:24:18,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:19,008 INFO L225 Difference]: With dead ends: 7396 [2019-12-27 18:24:19,009 INFO L226 Difference]: Without dead ends: 7396 [2019-12-27 18:24:19,009 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:24:19,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7396 states. [2019-12-27 18:24:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7396 to 4789. [2019-12-27 18:24:19,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4789 states. [2019-12-27 18:24:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4789 states to 4789 states and 14184 transitions. [2019-12-27 18:24:19,185 INFO L78 Accepts]: Start accepts. Automaton has 4789 states and 14184 transitions. Word has length 65 [2019-12-27 18:24:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:19,186 INFO L462 AbstractCegarLoop]: Abstraction has 4789 states and 14184 transitions. [2019-12-27 18:24:19,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:24:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 4789 states and 14184 transitions. [2019-12-27 18:24:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:24:19,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:19,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:19,207 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:19,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:19,207 INFO L82 PathProgramCache]: Analyzing trace with hash -655270585, now seen corresponding path program 1 times [2019-12-27 18:24:19,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:19,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384098394] [2019-12-27 18:24:19,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:19,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:19,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384098394] [2019-12-27 18:24:19,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:19,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:24:19,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1394783967] [2019-12-27 18:24:19,341 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:19,376 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:19,662 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 257 states and 492 transitions. [2019-12-27 18:24:19,662 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:19,704 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:24:19,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:24:19,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:19,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:24:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:24:19,705 INFO L87 Difference]: Start difference. First operand 4789 states and 14184 transitions. Second operand 6 states. [2019-12-27 18:24:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:20,409 INFO L93 Difference]: Finished difference Result 6988 states and 19973 transitions. [2019-12-27 18:24:20,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:24:20,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-27 18:24:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:20,418 INFO L225 Difference]: With dead ends: 6988 [2019-12-27 18:24:20,418 INFO L226 Difference]: Without dead ends: 6988 [2019-12-27 18:24:20,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:24:20,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6988 states. [2019-12-27 18:24:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6988 to 3627. [2019-12-27 18:24:20,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3627 states. [2019-12-27 18:24:20,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3627 states to 3627 states and 10539 transitions. [2019-12-27 18:24:20,483 INFO L78 Accepts]: Start accepts. Automaton has 3627 states and 10539 transitions. Word has length 66 [2019-12-27 18:24:20,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:20,483 INFO L462 AbstractCegarLoop]: Abstraction has 3627 states and 10539 transitions. [2019-12-27 18:24:20,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:24:20,484 INFO L276 IsEmpty]: Start isEmpty. Operand 3627 states and 10539 transitions. [2019-12-27 18:24:20,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:24:20,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:20,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:20,488 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:20,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1474263877, now seen corresponding path program 1 times [2019-12-27 18:24:20,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:20,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164537399] [2019-12-27 18:24:20,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:20,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:21,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164537399] [2019-12-27 18:24:21,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:21,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 18:24:21,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [120809100] [2019-12-27 18:24:21,131 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:21,151 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:21,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 271 states and 517 transitions. [2019-12-27 18:24:21,403 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:21,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:24:22,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:24:22,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:22,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:24:22,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:22,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:24:22,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:22,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:22,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-27 18:24:22,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:23,018 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-12-27 18:24:23,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:23,219 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 36 [2019-12-27 18:24:23,220 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 51 times. [2019-12-27 18:24:23,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-12-27 18:24:23,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:23,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-12-27 18:24:23,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1353, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 18:24:23,222 INFO L87 Difference]: Start difference. First operand 3627 states and 10539 transitions. Second operand 39 states. [2019-12-27 18:24:31,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:31,092 INFO L93 Difference]: Finished difference Result 11368 states and 32624 transitions. [2019-12-27 18:24:31,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-12-27 18:24:31,093 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 67 [2019-12-27 18:24:31,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:31,108 INFO L225 Difference]: With dead ends: 11368 [2019-12-27 18:24:31,108 INFO L226 Difference]: Without dead ends: 11329 [2019-12-27 18:24:31,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=688, Invalid=5632, Unknown=0, NotChecked=0, Total=6320 [2019-12-27 18:24:31,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11329 states. [2019-12-27 18:24:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11329 to 4607. [2019-12-27 18:24:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4607 states. [2019-12-27 18:24:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4607 states to 4607 states and 13215 transitions. [2019-12-27 18:24:31,211 INFO L78 Accepts]: Start accepts. Automaton has 4607 states and 13215 transitions. Word has length 67 [2019-12-27 18:24:31,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:31,211 INFO L462 AbstractCegarLoop]: Abstraction has 4607 states and 13215 transitions. [2019-12-27 18:24:31,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-12-27 18:24:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 4607 states and 13215 transitions. [2019-12-27 18:24:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:24:31,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:31,216 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:31,216 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:31,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:31,216 INFO L82 PathProgramCache]: Analyzing trace with hash -109802899, now seen corresponding path program 2 times [2019-12-27 18:24:31,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:31,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136794212] [2019-12-27 18:24:31,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:31,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136794212] [2019-12-27 18:24:31,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:31,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-27 18:24:31,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1943519582] [2019-12-27 18:24:31,615 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:31,639 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:31,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 253 states and 477 transitions. [2019-12-27 18:24:31,883 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:24:32,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:32,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-27 18:24:32,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:32,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:24:32,882 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 34 times. [2019-12-27 18:24:32,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-27 18:24:32,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-27 18:24:32,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=760, Unknown=0, NotChecked=0, Total=870 [2019-12-27 18:24:32,884 INFO L87 Difference]: Start difference. First operand 4607 states and 13215 transitions. Second operand 30 states. [2019-12-27 18:24:42,367 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 40 [2019-12-27 18:24:48,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:48,311 INFO L93 Difference]: Finished difference Result 21058 states and 58447 transitions. [2019-12-27 18:24:48,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-12-27 18:24:48,311 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 67 [2019-12-27 18:24:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:48,337 INFO L225 Difference]: With dead ends: 21058 [2019-12-27 18:24:48,337 INFO L226 Difference]: Without dead ends: 21026 [2019-12-27 18:24:48,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 13 SyntacticMatches, 11 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8340 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3163, Invalid=19789, Unknown=0, NotChecked=0, Total=22952 [2019-12-27 18:24:48,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21026 states. [2019-12-27 18:24:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21026 to 5773. [2019-12-27 18:24:48,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5773 states. [2019-12-27 18:24:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5773 states to 5773 states and 16569 transitions. [2019-12-27 18:24:48,516 INFO L78 Accepts]: Start accepts. Automaton has 5773 states and 16569 transitions. Word has length 67 [2019-12-27 18:24:48,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:48,516 INFO L462 AbstractCegarLoop]: Abstraction has 5773 states and 16569 transitions. [2019-12-27 18:24:48,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-27 18:24:48,516 INFO L276 IsEmpty]: Start isEmpty. Operand 5773 states and 16569 transitions. [2019-12-27 18:24:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:24:48,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:48,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:48,522 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1577894273, now seen corresponding path program 3 times [2019-12-27 18:24:48,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:48,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539992032] [2019-12-27 18:24:48,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:48,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:48,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:48,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539992032] [2019-12-27 18:24:48,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:48,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:24:48,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1995095989] [2019-12-27 18:24:48,741 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:48,758 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:48,931 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 264 states and 493 transitions. [2019-12-27 18:24:48,932 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:49,034 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 18:24:49,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:24:49,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:49,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:24:49,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:24:49,035 INFO L87 Difference]: Start difference. First operand 5773 states and 16569 transitions. Second operand 13 states. [2019-12-27 18:24:49,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:49,504 INFO L93 Difference]: Finished difference Result 8534 states and 24387 transitions. [2019-12-27 18:24:49,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 18:24:49,504 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 18:24:49,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:49,516 INFO L225 Difference]: With dead ends: 8534 [2019-12-27 18:24:49,517 INFO L226 Difference]: Without dead ends: 8502 [2019-12-27 18:24:49,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 12 SyntacticMatches, 12 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2019-12-27 18:24:49,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8502 states. [2019-12-27 18:24:49,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8502 to 4860. [2019-12-27 18:24:49,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4860 states. [2019-12-27 18:24:49,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4860 states to 4860 states and 13960 transitions. [2019-12-27 18:24:49,601 INFO L78 Accepts]: Start accepts. Automaton has 4860 states and 13960 transitions. Word has length 67 [2019-12-27 18:24:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:49,601 INFO L462 AbstractCegarLoop]: Abstraction has 4860 states and 13960 transitions. [2019-12-27 18:24:49,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:24:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4860 states and 13960 transitions. [2019-12-27 18:24:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:24:49,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:49,952 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:49,952 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:49,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1772687019, now seen corresponding path program 4 times [2019-12-27 18:24:49,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:49,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687728378] [2019-12-27 18:24:49,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:24:50,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:24:50,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687728378] [2019-12-27 18:24:50,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:24:50,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:24:50,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [502129704] [2019-12-27 18:24:50,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:24:50,050 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:24:50,278 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 259 states and 495 transitions. [2019-12-27 18:24:50,278 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:24:50,315 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:24:50,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:24:50,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:24:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:24:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:24:50,317 INFO L87 Difference]: Start difference. First operand 4860 states and 13960 transitions. Second operand 6 states. [2019-12-27 18:24:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:24:50,545 INFO L93 Difference]: Finished difference Result 6265 states and 17333 transitions. [2019-12-27 18:24:50,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:24:50,545 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 18:24:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:24:50,554 INFO L225 Difference]: With dead ends: 6265 [2019-12-27 18:24:50,554 INFO L226 Difference]: Without dead ends: 6265 [2019-12-27 18:24:50,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:24:50,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6265 states. [2019-12-27 18:24:50,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6265 to 4144. [2019-12-27 18:24:50,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4144 states. [2019-12-27 18:24:50,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 11624 transitions. [2019-12-27 18:24:50,620 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 11624 transitions. Word has length 67 [2019-12-27 18:24:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:24:50,621 INFO L462 AbstractCegarLoop]: Abstraction has 4144 states and 11624 transitions. [2019-12-27 18:24:50,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:24:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 11624 transitions. [2019-12-27 18:24:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:24:50,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:24:50,625 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:24:50,625 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:24:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:24:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 15770806, now seen corresponding path program 1 times [2019-12-27 18:24:50,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:24:50,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477083946] [2019-12-27 18:24:50,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:24:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:24:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:24:50,732 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:24:50,732 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:24:50,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~y$mem_tmp~0_39 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2183~0.base_27|) |v_ULTIMATE.start_main_~#t2183~0.offset_20| 0)) |v_#memory_int_21|) (= 0 v_~y$r_buff0_thd3~0_110) (= (store .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27| 1) |v_#valid_63|) (= v_~main$tmp_guard0~0_18 0) (= v_~weak$$choice2~0_126 0) (= 0 v_~x~0_147) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff1~0_200 0) (= 0 v_~y$w_buff0~0_179) (= v_~y~0_170 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~y$r_buff1_thd0~0_299 0) (= 0 v_~y$r_buff1_thd2~0_193) (= v_~y$r_buff0_thd1~0_223 0) (= 0 |v_ULTIMATE.start_main_~#t2183~0.offset_20|) (= 0 v_~__unbuffered_p2_EAX~0_33) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2183~0.base_27| 4)) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$flush_delayed~0_56) (= |v_#NULL.offset_5| 0) (= v_~y$w_buff1_used~0_482 0) (= 0 v_~y$r_buff1_thd3~0_211) (= 0 v_~y$r_buff0_thd2~0_114) (= v_~__unbuffered_cnt~0_132 0) (= v_~y$w_buff0_used~0_741 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2183~0.base_27|)) (= 0 v_~weak$$choice0~0_34) (= 0 |v_#NULL.base_5|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2183~0.base_27|) (= v_~y$r_buff1_thd1~0_185 0) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_61|, ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_16|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_19|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_27|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_45|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_141|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_41|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_76|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_62|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_36|, ~y$mem_tmp~0=v_~y$mem_tmp~0_39, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_211, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_223, ~y$flush_delayed~0=v_~y$flush_delayed~0_56, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_9|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_82|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_54|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_64|, ULTIMATE.start_main_~#t2183~0.offset=|v_ULTIMATE.start_main_~#t2183~0.offset_20|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~weak$$choice0~0=v_~weak$$choice0~0_34, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_114, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_132, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_299, ~x~0=v_~x~0_147, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_61|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_741, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_73|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_27|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_161|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_76|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_185, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y$w_buff0~0=v_~y$w_buff0~0_179, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_110, ULTIMATE.start_main_~#t2183~0.base=|v_ULTIMATE.start_main_~#t2183~0.base_27|, ~y~0=v_~y~0_170, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_18|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_43|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_70|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_18, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_25|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_50|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_193, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_75|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_23|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_126, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_482} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_~#t2183~0.offset, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet31, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t2183~0.base, ~y~0, ULTIMATE.start_main_~#t2184~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t2184~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:24:50,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [691] [691] P0ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_135 1) (= v_P0Thread1of1ForFork0_~arg.offset_8 |v_P0Thread1of1ForFork0_#in~arg.offset_8|) (= v_P0Thread1of1ForFork0_~arg.base_8 |v_P0Thread1of1ForFork0_#in~arg.base_8|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 2 v_~y$w_buff0~0_28) (= (mod v_~y$w_buff1_used~0_63 256) 0) (= v_~y$w_buff0~0_29 v_~y$w_buff1~0_20) (= v_~y$w_buff1_used~0_63 v_~y$w_buff0_used~0_136) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ~y$w_buff0~0=v_~y$w_buff0~0_29, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_135, ~y$w_buff1~0=v_~y$w_buff1~0_20, ~y$w_buff0~0=v_~y$w_buff0~0_28, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_10, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_8|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_8, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_63} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:24:50,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L800-1-->L802: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t2184~0.base_11|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2184~0.base_11|) |v_ULTIMATE.start_main_~#t2184~0.offset_10| 1)) |v_#memory_int_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11| 1)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2184~0.base_11|) (= 0 |v_ULTIMATE.start_main_~#t2184~0.offset_10|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2184~0.base_11| 4) |v_#length_15|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t2184~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, ULTIMATE.start_main_~#t2184~0.base=|v_ULTIMATE.start_main_~#t2184~0.base_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2184~0.offset=|v_ULTIMATE.start_main_~#t2184~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_~#t2184~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2184~0.offset] because there is no mapped edge [2019-12-27 18:24:50,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L802-1-->L804: Formula: (and (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13| 1)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2185~0.base_13|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2185~0.base_13|) |v_ULTIMATE.start_main_~#t2185~0.offset_11| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2185~0.offset_11|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t2185~0.base_13|) 0) (not (= |v_ULTIMATE.start_main_~#t2185~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2185~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2185~0.offset=|v_ULTIMATE.start_main_~#t2185~0.offset_11|, ULTIMATE.start_main_~#t2185~0.base=|v_ULTIMATE.start_main_~#t2185~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2185~0.offset, ULTIMATE.start_main_~#t2185~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 18:24:50,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-692487079 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-692487079 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-692487079| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-692487079| ~y$w_buff0_used~0_In-692487079) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-692487079, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-692487079} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-692487079|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-692487079, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-692487079} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:24:50,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L757-2-->L757-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In409444334 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In409444334 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In409444334 |P1Thread1of1ForFork1_#t~ite9_Out409444334|)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out409444334| ~y~0_In409444334) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In409444334, ~y$w_buff1~0=~y$w_buff1~0_In409444334, ~y~0=~y~0_In409444334, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409444334} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In409444334, ~y$w_buff1~0=~y$w_buff1~0_In409444334, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out409444334|, ~y~0=~y~0_In409444334, ~y$w_buff1_used~0=~y$w_buff1_used~0_In409444334} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:24:50,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-544728059 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-544728059 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-544728059 256))) (.cse2 (= (mod ~y$r_buff0_thd1~0_In-544728059 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-544728059| 0)) (and (= ~y$w_buff1_used~0_In-544728059 |P0Thread1of1ForFork0_#t~ite6_Out-544728059|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-544728059, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-544728059, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-544728059, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-544728059} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-544728059|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-544728059, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-544728059, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-544728059, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-544728059} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:24:50,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L743-->L744: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-2064483483 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2064483483 256)))) (or (and (not .cse0) (= 0 ~y$r_buff0_thd1~0_Out-2064483483) (not .cse1)) (and (= ~y$r_buff0_thd1~0_In-2064483483 ~y$r_buff0_thd1~0_Out-2064483483) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2064483483, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-2064483483} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2064483483, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-2064483483|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-2064483483} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 18:24:50,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In600300731 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In600300731 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In600300731 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In600300731 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd1~0_In600300731 |P0Thread1of1ForFork0_#t~ite8_Out600300731|) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out600300731|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In600300731, ~y$w_buff0_used~0=~y$w_buff0_used~0_In600300731, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In600300731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In600300731} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In600300731, ~y$w_buff0_used~0=~y$w_buff0_used~0_In600300731, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out600300731|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In600300731, ~y$w_buff1_used~0=~y$w_buff1_used~0_In600300731} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:24:50,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L744-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_50 |v_P0Thread1of1ForFork0_#t~ite8_28|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_50, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 18:24:50,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L777-2-->L777-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1157808996 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1157808996 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-1157808996| ~y~0_In-1157808996) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In-1157808996 |P2Thread1of1ForFork2_#t~ite15_Out-1157808996|) (not .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1157808996, ~y$w_buff1~0=~y$w_buff1~0_In-1157808996, ~y~0=~y~0_In-1157808996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1157808996} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1157808996, P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1157808996|, ~y$w_buff1~0=~y$w_buff1~0_In-1157808996, ~y~0=~y~0_In-1157808996, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1157808996} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:24:50,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-4-->L778: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~y~0_34) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, ~y~0=v_~y~0_34, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~y~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-27 18:24:50,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L757-4-->L758: Formula: (= |v_P1Thread1of1ForFork1_#t~ite9_8| v_~y~0_38) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_8|} OutVars{P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_7|, P1Thread1of1ForFork1_#t~ite10=|v_P1Thread1of1ForFork1_#t~ite10_7|, ~y~0=v_~y~0_38} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10, ~y~0] because there is no mapped edge [2019-12-27 18:24:50,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1240338723 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1240338723 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1240338723| ~y$w_buff0_used~0_In-1240338723)) (and (= 0 |P1Thread1of1ForFork1_#t~ite11_Out-1240338723|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1240338723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1240338723} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1240338723, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1240338723, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1240338723|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:24:50,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L759-->L759-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1013953395 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1013953395 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In1013953395 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1013953395 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite12_Out1013953395| ~y$w_buff1_used~0_In1013953395)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite12_Out1013953395| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1013953395, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1013953395, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1013953395, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1013953395} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1013953395, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1013953395, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1013953395, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out1013953395|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1013953395} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:24:50,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1823590081 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1823590081 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1823590081| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out1823590081| ~y$r_buff0_thd2~0_In1823590081)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1823590081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1823590081} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1823590081, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1823590081, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1823590081|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-27 18:24:50,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L761-->L761-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1824199416 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1824199416 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1824199416 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1824199416 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In1824199416 |P1Thread1of1ForFork1_#t~ite14_Out1824199416|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out1824199416|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1824199416, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1824199416, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1824199416, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1824199416} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1824199416, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1824199416, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1824199416, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1824199416|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1824199416} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:24:50,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1189776656 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1189776656 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out1189776656| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1189776656 |P2Thread1of1ForFork2_#t~ite17_Out1189776656|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1189776656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1189776656} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1189776656, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1189776656, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1189776656|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:24:50,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L779-->L779-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1293143992 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1293143992 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1293143992 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In-1293143992 256)))) (or (and (= ~y$w_buff1_used~0_In-1293143992 |P2Thread1of1ForFork2_#t~ite18_Out-1293143992|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork2_#t~ite18_Out-1293143992|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1293143992, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1293143992, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1293143992, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1293143992} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1293143992, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1293143992, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1293143992, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1293143992|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1293143992} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:24:50,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L761-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_135 |v_P1Thread1of1ForFork1_#t~ite14_42|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_135, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 18:24:50,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L780-->L780-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1144079436 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1144079436 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1144079436| ~y$r_buff0_thd3~0_In1144079436)) (and (= |P2Thread1of1ForFork2_#t~ite19_Out1144079436| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1144079436, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1144079436} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1144079436, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1144079436, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1144079436|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:24:50,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In1822105011 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1822105011 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In1822105011 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1822105011 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite20_Out1822105011| ~y$r_buff1_thd3~0_In1822105011)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite20_Out1822105011| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1822105011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1822105011, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1822105011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1822105011} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1822105011, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1822105011, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1822105011|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1822105011, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1822105011} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:24:50,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L781-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= |v_P2Thread1of1ForFork2_#t~ite20_36| v_~y$r_buff1_thd3~0_132) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_132, P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_35|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite20, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-27 18:24:50,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L804-1-->L810: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:24:50,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L810-2-->L810-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite25_Out-538853380| |ULTIMATE.start_main_#t~ite24_Out-538853380|)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-538853380 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-538853380 256) 0))) (or (and .cse0 (not .cse1) (not .cse2) (= ~y$w_buff1~0_In-538853380 |ULTIMATE.start_main_#t~ite24_Out-538853380|)) (and (= ~y~0_In-538853380 |ULTIMATE.start_main_#t~ite24_Out-538853380|) .cse0 (or .cse1 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-538853380, ~y~0=~y~0_In-538853380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-538853380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-538853380} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-538853380, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-538853380|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-538853380|, ~y~0=~y~0_In-538853380, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-538853380, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-538853380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 18:24:50,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1409328242 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1409328242 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out1409328242|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out1409328242| ~y$w_buff0_used~0_In1409328242)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1409328242, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1409328242} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1409328242, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1409328242, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1409328242|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:24:50,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L812-->L812-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1754692131 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1754692131 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In-1754692131 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1754692131 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite27_Out-1754692131|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1754692131 |ULTIMATE.start_main_#t~ite27_Out-1754692131|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1754692131, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1754692131, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1754692131, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1754692131} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1754692131, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1754692131, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-1754692131|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1754692131, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1754692131} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:24:50,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L813-->L813-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1296027285 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1296027285 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite28_Out1296027285| 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1296027285 |ULTIMATE.start_main_#t~ite28_Out1296027285|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1296027285, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1296027285} OutVars{ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1296027285|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1296027285, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1296027285} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:24:50,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L814-->L814-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1433915075 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1433915075 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1433915075 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1433915075 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1433915075 |ULTIMATE.start_main_#t~ite29_Out1433915075|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite29_Out1433915075|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1433915075, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1433915075, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1433915075, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1433915075} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1433915075, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1433915075|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1433915075, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1433915075, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1433915075} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:24:50,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L823-->L823-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In669606943 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_In669606943| |ULTIMATE.start_main_#t~ite38_Out669606943|) (not .cse0) (= ~y$w_buff1~0_In669606943 |ULTIMATE.start_main_#t~ite39_Out669606943|)) (and .cse0 (= |ULTIMATE.start_main_#t~ite38_Out669606943| ~y$w_buff1~0_In669606943) (= |ULTIMATE.start_main_#t~ite38_Out669606943| |ULTIMATE.start_main_#t~ite39_Out669606943|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In669606943 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In669606943 256)) .cse1) (= (mod ~y$w_buff0_used~0_In669606943 256) 0) (and (= 0 (mod ~y$r_buff1_thd0~0_In669606943 256)) .cse1)))))) InVars {~y$w_buff1~0=~y$w_buff1~0_In669606943, ~y$w_buff0_used~0=~y$w_buff0_used~0_In669606943, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In669606943, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In669606943|, ~weak$$choice2~0=~weak$$choice2~0_In669606943, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In669606943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In669606943} OutVars{~y$w_buff1~0=~y$w_buff1~0_In669606943, ~y$w_buff0_used~0=~y$w_buff0_used~0_In669606943, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out669606943|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In669606943, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out669606943|, ~weak$$choice2~0=~weak$$choice2~0_In669606943, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In669606943, ~y$w_buff1_used~0=~y$w_buff1_used~0_In669606943} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 18:24:50,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L824-->L824-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2055843884 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-2055843884| |ULTIMATE.start_main_#t~ite41_Out-2055843884|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2055843884 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-2055843884 256))) (and .cse0 (= (mod ~y$r_buff1_thd0~0_In-2055843884 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-2055843884 256)))) .cse1 (= |ULTIMATE.start_main_#t~ite41_Out-2055843884| ~y$w_buff0_used~0_In-2055843884)) (and (= |ULTIMATE.start_main_#t~ite41_In-2055843884| |ULTIMATE.start_main_#t~ite41_Out-2055843884|) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-2055843884| ~y$w_buff0_used~0_In-2055843884)))) InVars {ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_In-2055843884|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055843884, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2055843884, ~weak$$choice2~0=~weak$$choice2~0_In-2055843884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2055843884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2055843884} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2055843884|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2055843884, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2055843884, ~weak$$choice2~0=~weak$$choice2~0_In-2055843884, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-2055843884|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2055843884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2055843884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 18:24:50,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L826-->L827: Formula: (and (= v_~y$r_buff0_thd0~0_133 v_~y$r_buff0_thd0~0_132) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_133, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_132, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_22|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_13|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_8|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 18:24:50,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L829-->L832-1: Formula: (and (not (= (mod v_~y$flush_delayed~0_45 256) 0)) (= 0 v_~y$flush_delayed~0_44) (= v_~y~0_135 v_~y$mem_tmp~0_33) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_44, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y~0=v_~y~0_135, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:24:50,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:24:50,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:24:50 BasicIcfg [2019-12-27 18:24:50,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:24:50,839 INFO L168 Benchmark]: Toolchain (without parser) took 115907.58 ms. Allocated memory was 142.1 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 100.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-27 18:24:50,840 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 142.1 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:24:50,841 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.17 ms. Allocated memory was 142.1 MB in the beginning and 203.9 MB in the end (delta: 61.9 MB). Free memory was 100.0 MB in the beginning and 157.2 MB in the end (delta: -57.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:24:50,841 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.85 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:24:50,842 INFO L168 Benchmark]: Boogie Preprocessor took 38.98 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:24:50,842 INFO L168 Benchmark]: RCFGBuilder took 949.31 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.8 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:24:50,843 INFO L168 Benchmark]: TraceAbstraction took 114044.85 ms. Allocated memory was 203.9 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-27 18:24:50,846 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 142.1 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 805.17 ms. Allocated memory was 142.1 MB in the beginning and 203.9 MB in the end (delta: 61.9 MB). Free memory was 100.0 MB in the beginning and 157.2 MB in the end (delta: -57.2 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.85 ms. Allocated memory is still 203.9 MB. Free memory was 157.2 MB in the beginning and 153.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.98 ms. Allocated memory is still 203.9 MB. Free memory was 153.9 MB in the beginning and 152.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 949.31 ms. Allocated memory is still 203.9 MB. Free memory was 152.0 MB in the beginning and 101.8 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114044.85 ms. Allocated memory was 203.9 MB in the beginning and 3.9 GB in the end (delta: 3.6 GB). Free memory was 101.8 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 173 ProgramPointsBefore, 94 ProgramPointsAfterwards, 210 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 39 ConcurrentYvCompositions, 31 ChoiceCompositions, 5882 VarBasedMoverChecksPositive, 246 VarBasedMoverChecksNegative, 66 SemBasedMoverChecksPositive, 253 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 78185 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t2183, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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] [L730] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L731] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L732] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L733] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L734] 1 y$r_buff0_thd1 = (_Bool)1 [L737] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L802] FCALL, FORK 0 pthread_create(&t2184, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L804] FCALL, FORK 0 pthread_create(&t2185, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L771] 3 __unbuffered_p2_EAX = x [L774] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L777] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L758] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L759] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L760] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 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 [L780] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 164 locations, 2 error locations. Result: UNSAFE, OverallTime: 113.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 47.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3515 SDtfs, 7762 SDslu, 14662 SDs, 0 SdLazy, 19310 SolverSat, 872 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 674 GetRequests, 186 SyntacticMatches, 78 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11116 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156321occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 32.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 102782 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 978 NumberOfCodeBlocks, 978 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 891 ConstructedInterpolants, 0 QuantifiedInterpolants, 210869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...