/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:35:05,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:35:05,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:35:05,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:35:05,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:35:05,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:35:05,778 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:35:05,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:35:05,782 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:35:05,783 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:35:05,784 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:35:05,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:35:05,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:35:05,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:35:05,787 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:35:05,788 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:35:05,789 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:35:05,790 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:35:05,791 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:35:05,793 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:35:05,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:35:05,795 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:35:05,796 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:35:05,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:35:05,799 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:35:05,800 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:35:05,800 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:35:05,801 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:35:05,801 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:35:05,802 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:35:05,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:35:05,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:35:05,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:35:05,804 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:35:05,805 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:35:05,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:35:05,806 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:35:05,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:35:05,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:35:05,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:35:05,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:35:05,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:35:05,830 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:35:05,830 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:35:05,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:35:05,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:35:05,832 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:35:05,832 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:35:05,832 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:35:05,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:35:05,833 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:35:05,833 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:35:05,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:35:05,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:35:05,835 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:35:05,835 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:35:05,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:35:05,835 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:35:05,836 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:35:05,836 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:35:05,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:35:05,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:35:05,837 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:35:05,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:35:05,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:35:05,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:35:05,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:35:05,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:35:05,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:35:05,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:35:05,838 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:35:05,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:35:06,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:35:06,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:35:06,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:35:06,122 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:35:06,123 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:35:06,124 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe005_pso.oepc.i [2019-12-26 23:35:06,182 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6012188e5/4e6a975b57994137a6c3a34b278f42a6/FLAG853f707bc [2019-12-26 23:35:06,727 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:35:06,728 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe005_pso.oepc.i [2019-12-26 23:35:06,744 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6012188e5/4e6a975b57994137a6c3a34b278f42a6/FLAG853f707bc [2019-12-26 23:35:07,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6012188e5/4e6a975b57994137a6c3a34b278f42a6 [2019-12-26 23:35:07,016 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:35:07,018 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:35:07,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:35:07,020 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:35:07,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:35:07,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@746c584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07, skipping insertion in model container [2019-12-26 23:35:07,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:35:07,103 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:35:07,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:35:07,628 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:35:07,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:35:07,797 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:35:07,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07 WrapperNode [2019-12-26 23:35:07,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:35:07,799 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:35:07,799 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:35:07,799 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:35:07,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,847 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:35:07,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:35:07,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:35:07,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:35:07,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,896 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,897 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,906 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,910 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (1/1) ... [2019-12-26 23:35:07,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:35:07,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:35:07,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:35:07,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:35:07,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (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-26 23:35:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:35:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:35:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:35:08,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:35:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:35:08,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:35:08,004 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:35:08,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:35:08,005 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:35:08,006 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:35:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:35:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:35:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:35:08,009 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:35:08,713 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:35:08,713 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:35:08,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:35:08 BoogieIcfgContainer [2019-12-26 23:35:08,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:35:08,716 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:35:08,716 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:35:08,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:35:08,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:35:07" (1/3) ... [2019-12-26 23:35:08,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d857f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:35:08, skipping insertion in model container [2019-12-26 23:35:08,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:35:07" (2/3) ... [2019-12-26 23:35:08,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61d857f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:35:08, skipping insertion in model container [2019-12-26 23:35:08,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:35:08" (3/3) ... [2019-12-26 23:35:08,724 INFO L109 eAbstractionObserver]: Analyzing ICFG safe005_pso.oepc.i [2019-12-26 23:35:08,736 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:35:08,736 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:35:08,745 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:35:08,746 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:35:08,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,787 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,788 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,788 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,789 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,789 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,790 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,791 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,792 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,793 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,794 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,795 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,796 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,799 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,808 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,809 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,810 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,811 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,812 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,813 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,814 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,815 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,816 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,823 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,852 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,857 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,857 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,863 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,864 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,865 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,866 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:35:08,884 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:35:08,904 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:35:08,904 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:35:08,904 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:35:08,904 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:35:08,904 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:35:08,905 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:35:08,905 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:35:08,905 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:35:08,922 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 163 places, 194 transitions [2019-12-26 23:35:08,924 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:35:09,022 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:35:09,022 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:35:09,037 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:35:09,061 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 163 places, 194 transitions [2019-12-26 23:35:09,111 INFO L132 PetriNetUnfolder]: 41/191 cut-off events. [2019-12-26 23:35:09,111 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:35:09,119 INFO L76 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 191 events. 41/191 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 452 event pairs. 0/148 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:35:09,139 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:35:09,140 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:35:14,600 WARN L192 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-26 23:35:14,724 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-26 23:35:14,852 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66367 [2019-12-26 23:35:14,852 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-26 23:35:14,856 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-26 23:35:26,587 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 86132 states. [2019-12-26 23:35:26,589 INFO L276 IsEmpty]: Start isEmpty. Operand 86132 states. [2019-12-26 23:35:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:35:26,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:26,597 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:35:26,598 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:26,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:26,604 INFO L82 PathProgramCache]: Analyzing trace with hash 795562213, now seen corresponding path program 1 times [2019-12-26 23:35:26,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:26,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407974067] [2019-12-26 23:35:26,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:26,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:26,838 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-26 23:35:26,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407974067] [2019-12-26 23:35:26,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:26,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:35:26,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140935972] [2019-12-26 23:35:26,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:35:26,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:26,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:35:26,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:35:26,865 INFO L87 Difference]: Start difference. First operand 86132 states. Second operand 3 states. [2019-12-26 23:35:29,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:29,351 INFO L93 Difference]: Finished difference Result 85012 states and 367904 transitions. [2019-12-26 23:35:29,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:35:29,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:35:29,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:29,963 INFO L225 Difference]: With dead ends: 85012 [2019-12-26 23:35:29,964 INFO L226 Difference]: Without dead ends: 80140 [2019-12-26 23:35:29,965 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-26 23:35:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80140 states. [2019-12-26 23:35:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80140 to 80140. [2019-12-26 23:35:37,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80140 states. [2019-12-26 23:35:40,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80140 states to 80140 states and 346330 transitions. [2019-12-26 23:35:40,020 INFO L78 Accepts]: Start accepts. Automaton has 80140 states and 346330 transitions. Word has length 5 [2019-12-26 23:35:40,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:40,021 INFO L462 AbstractCegarLoop]: Abstraction has 80140 states and 346330 transitions. [2019-12-26 23:35:40,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:35:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 80140 states and 346330 transitions. [2019-12-26 23:35:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:35:40,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:40,030 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:40,030 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:40,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash -36571135, now seen corresponding path program 1 times [2019-12-26 23:35:40,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:40,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604566454] [2019-12-26 23:35:40,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:40,175 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-26 23:35:40,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604566454] [2019-12-26 23:35:40,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:40,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:35:40,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656483249] [2019-12-26 23:35:40,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:35:40,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:40,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:35:40,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:35:40,180 INFO L87 Difference]: Start difference. First operand 80140 states and 346330 transitions. Second operand 4 states. [2019-12-26 23:35:44,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:44,577 INFO L93 Difference]: Finished difference Result 123388 states and 510822 transitions. [2019-12-26 23:35:44,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:35:44,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:35:44,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:45,078 INFO L225 Difference]: With dead ends: 123388 [2019-12-26 23:35:45,078 INFO L226 Difference]: Without dead ends: 123290 [2019-12-26 23:35:45,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:35:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123290 states. [2019-12-26 23:35:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123290 to 114218. [2019-12-26 23:35:50,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114218 states. [2019-12-26 23:35:56,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114218 states to 114218 states and 477794 transitions. [2019-12-26 23:35:56,184 INFO L78 Accepts]: Start accepts. Automaton has 114218 states and 477794 transitions. Word has length 13 [2019-12-26 23:35:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:35:56,185 INFO L462 AbstractCegarLoop]: Abstraction has 114218 states and 477794 transitions. [2019-12-26 23:35:56,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:35:56,185 INFO L276 IsEmpty]: Start isEmpty. Operand 114218 states and 477794 transitions. [2019-12-26 23:35:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:35:56,189 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:35:56,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:35:56,190 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:35:56,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:35:56,190 INFO L82 PathProgramCache]: Analyzing trace with hash 424299118, now seen corresponding path program 1 times [2019-12-26 23:35:56,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:35:56,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294066618] [2019-12-26 23:35:56,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:35:56,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:35:56,329 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-26 23:35:56,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294066618] [2019-12-26 23:35:56,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:35:56,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:35:56,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009199512] [2019-12-26 23:35:56,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:35:56,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:35:56,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:35:56,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:35:56,333 INFO L87 Difference]: Start difference. First operand 114218 states and 477794 transitions. Second operand 4 states. [2019-12-26 23:35:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:35:57,366 INFO L93 Difference]: Finished difference Result 159677 states and 652290 transitions. [2019-12-26 23:35:57,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:35:57,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:35:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:35:59,514 INFO L225 Difference]: With dead ends: 159677 [2019-12-26 23:35:59,514 INFO L226 Difference]: Without dead ends: 159565 [2019-12-26 23:35:59,515 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-26 23:36:03,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159565 states. [2019-12-26 23:36:07,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159565 to 136035. [2019-12-26 23:36:07,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136035 states. [2019-12-26 23:36:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136035 states to 136035 states and 564894 transitions. [2019-12-26 23:36:15,838 INFO L78 Accepts]: Start accepts. Automaton has 136035 states and 564894 transitions. Word has length 13 [2019-12-26 23:36:15,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:36:15,839 INFO L462 AbstractCegarLoop]: Abstraction has 136035 states and 564894 transitions. [2019-12-26 23:36:15,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:36:15,839 INFO L276 IsEmpty]: Start isEmpty. Operand 136035 states and 564894 transitions. [2019-12-26 23:36:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:36:15,843 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:36:15,843 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:36:15,843 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:36:15,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:36:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2100241523, now seen corresponding path program 1 times [2019-12-26 23:36:15,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:36:15,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079189701] [2019-12-26 23:36:15,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:36:15,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:36:15,940 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-26 23:36:15,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079189701] [2019-12-26 23:36:15,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:36:15,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:36:15,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816088944] [2019-12-26 23:36:15,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:36:15,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:36:15,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:36:15,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:36:15,943 INFO L87 Difference]: Start difference. First operand 136035 states and 564894 transitions. Second operand 3 states. [2019-12-26 23:36:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:36:18,077 INFO L93 Difference]: Finished difference Result 181618 states and 742473 transitions. [2019-12-26 23:36:18,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:36:18,078 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-26 23:36:18,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:36:18,736 INFO L225 Difference]: With dead ends: 181618 [2019-12-26 23:36:18,736 INFO L226 Difference]: Without dead ends: 181618 [2019-12-26 23:36:18,736 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-26 23:36:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181618 states. [2019-12-26 23:36:30,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181618 to 152081. [2019-12-26 23:36:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152081 states. [2019-12-26 23:36:30,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152081 states to 152081 states and 628919 transitions. [2019-12-26 23:36:30,997 INFO L78 Accepts]: Start accepts. Automaton has 152081 states and 628919 transitions. Word has length 14 [2019-12-26 23:36:30,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:36:30,998 INFO L462 AbstractCegarLoop]: Abstraction has 152081 states and 628919 transitions. [2019-12-26 23:36:30,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:36:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 152081 states and 628919 transitions. [2019-12-26 23:36:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:36:31,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:36:31,002 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:36:31,002 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:36:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:36:31,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2100376187, now seen corresponding path program 1 times [2019-12-26 23:36:31,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:36:31,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294392490] [2019-12-26 23:36:31,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:36:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:36:31,050 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-26 23:36:31,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294392490] [2019-12-26 23:36:31,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:36:31,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:36:31,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026996503] [2019-12-26 23:36:31,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:36:31,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:36:31,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:36:31,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:36:31,053 INFO L87 Difference]: Start difference. First operand 152081 states and 628919 transitions. Second operand 4 states. [2019-12-26 23:36:33,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:36:33,174 INFO L93 Difference]: Finished difference Result 179622 states and 732719 transitions. [2019-12-26 23:36:33,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:36:33,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:36:33,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:36:33,721 INFO L225 Difference]: With dead ends: 179622 [2019-12-26 23:36:33,721 INFO L226 Difference]: Without dead ends: 179542 [2019-12-26 23:36:33,721 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-26 23:36:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179542 states. [2019-12-26 23:36:46,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179542 to 157787. [2019-12-26 23:36:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157787 states. [2019-12-26 23:36:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157787 states to 157787 states and 651479 transitions. [2019-12-26 23:36:47,248 INFO L78 Accepts]: Start accepts. Automaton has 157787 states and 651479 transitions. Word has length 14 [2019-12-26 23:36:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:36:47,248 INFO L462 AbstractCegarLoop]: Abstraction has 157787 states and 651479 transitions. [2019-12-26 23:36:47,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:36:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 157787 states and 651479 transitions. [2019-12-26 23:36:47,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:36:47,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:36:47,252 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:36:47,252 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:36:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:36:47,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1940234062, now seen corresponding path program 1 times [2019-12-26 23:36:47,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:36:47,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108390442] [2019-12-26 23:36:47,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:36:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:36:47,315 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-26 23:36:47,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108390442] [2019-12-26 23:36:47,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:36:47,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:36:47,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302741691] [2019-12-26 23:36:47,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:36:47,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:36:47,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:36:47,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:36:47,318 INFO L87 Difference]: Start difference. First operand 157787 states and 651479 transitions. Second operand 4 states. [2019-12-26 23:36:49,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:36:49,705 INFO L93 Difference]: Finished difference Result 189091 states and 772001 transitions. [2019-12-26 23:36:49,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:36:49,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:36:49,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:36:50,357 INFO L225 Difference]: With dead ends: 189091 [2019-12-26 23:36:50,357 INFO L226 Difference]: Without dead ends: 188995 [2019-12-26 23:36:50,357 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-26 23:37:01,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188995 states. [2019-12-26 23:37:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188995 to 161868. [2019-12-26 23:37:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161868 states. [2019-12-26 23:37:05,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161868 states to 161868 states and 668265 transitions. [2019-12-26 23:37:05,066 INFO L78 Accepts]: Start accepts. Automaton has 161868 states and 668265 transitions. Word has length 14 [2019-12-26 23:37:05,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:05,066 INFO L462 AbstractCegarLoop]: Abstraction has 161868 states and 668265 transitions. [2019-12-26 23:37:05,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:37:05,067 INFO L276 IsEmpty]: Start isEmpty. Operand 161868 states and 668265 transitions. [2019-12-26 23:37:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:37:05,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:05,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:37:05,088 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:05,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:05,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1828891691, now seen corresponding path program 1 times [2019-12-26 23:37:05,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:05,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904702645] [2019-12-26 23:37:05,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:05,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:05,136 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-26 23:37:05,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904702645] [2019-12-26 23:37:05,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:05,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:37:05,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121952074] [2019-12-26 23:37:05,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:37:05,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:05,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:37:05,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:37:05,140 INFO L87 Difference]: Start difference. First operand 161868 states and 668265 transitions. Second operand 3 states. [2019-12-26 23:37:11,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:11,905 INFO L93 Difference]: Finished difference Result 160940 states and 664422 transitions. [2019-12-26 23:37:11,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:37:11,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:37:11,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:12,438 INFO L225 Difference]: With dead ends: 160940 [2019-12-26 23:37:12,438 INFO L226 Difference]: Without dead ends: 160940 [2019-12-26 23:37:12,439 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-26 23:37:16,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160940 states. [2019-12-26 23:37:19,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160940 to 160940. [2019-12-26 23:37:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160940 states. [2019-12-26 23:37:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160940 states to 160940 states and 664422 transitions. [2019-12-26 23:37:19,687 INFO L78 Accepts]: Start accepts. Automaton has 160940 states and 664422 transitions. Word has length 18 [2019-12-26 23:37:19,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:19,688 INFO L462 AbstractCegarLoop]: Abstraction has 160940 states and 664422 transitions. [2019-12-26 23:37:19,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:37:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 160940 states and 664422 transitions. [2019-12-26 23:37:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:37:19,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:19,709 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-26 23:37:19,709 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2025528817, now seen corresponding path program 1 times [2019-12-26 23:37:19,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:19,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070140016] [2019-12-26 23:37:19,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:19,767 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-26 23:37:19,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070140016] [2019-12-26 23:37:19,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:19,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:37:19,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164842654] [2019-12-26 23:37:19,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:37:19,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:37:19,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:37:19,769 INFO L87 Difference]: Start difference. First operand 160940 states and 664422 transitions. Second operand 4 states. [2019-12-26 23:37:22,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:22,320 INFO L93 Difference]: Finished difference Result 297697 states and 1230452 transitions. [2019-12-26 23:37:22,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:37:22,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:37:22,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:30,630 INFO L225 Difference]: With dead ends: 297697 [2019-12-26 23:37:30,630 INFO L226 Difference]: Without dead ends: 170729 [2019-12-26 23:37:30,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:37:34,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170729 states. [2019-12-26 23:37:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170729 to 169732. [2019-12-26 23:37:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169732 states. [2019-12-26 23:37:38,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169732 states to 169732 states and 694021 transitions. [2019-12-26 23:37:38,102 INFO L78 Accepts]: Start accepts. Automaton has 169732 states and 694021 transitions. Word has length 19 [2019-12-26 23:37:38,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:38,102 INFO L462 AbstractCegarLoop]: Abstraction has 169732 states and 694021 transitions. [2019-12-26 23:37:38,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:37:38,102 INFO L276 IsEmpty]: Start isEmpty. Operand 169732 states and 694021 transitions. [2019-12-26 23:37:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:37:38,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:38,121 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-26 23:37:38,121 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash 550104482, now seen corresponding path program 1 times [2019-12-26 23:37:38,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:38,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906129681] [2019-12-26 23:37:38,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:38,184 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-26 23:37:38,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906129681] [2019-12-26 23:37:38,185 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:38,185 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:37:38,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881395482] [2019-12-26 23:37:38,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:37:38,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:38,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:37:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:37:38,186 INFO L87 Difference]: Start difference. First operand 169732 states and 694021 transitions. Second operand 4 states. [2019-12-26 23:37:38,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:38,406 INFO L93 Difference]: Finished difference Result 49048 states and 168395 transitions. [2019-12-26 23:37:38,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:37:38,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:37:38,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:39,617 INFO L225 Difference]: With dead ends: 49048 [2019-12-26 23:37:39,617 INFO L226 Difference]: Without dead ends: 38053 [2019-12-26 23:37:39,617 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-26 23:37:39,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38053 states. [2019-12-26 23:37:40,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38053 to 37601. [2019-12-26 23:37:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37601 states. [2019-12-26 23:37:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37601 states to 37601 states and 124116 transitions. [2019-12-26 23:37:40,264 INFO L78 Accepts]: Start accepts. Automaton has 37601 states and 124116 transitions. Word has length 19 [2019-12-26 23:37:40,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:40,265 INFO L462 AbstractCegarLoop]: Abstraction has 37601 states and 124116 transitions. [2019-12-26 23:37:40,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:37:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37601 states and 124116 transitions. [2019-12-26 23:37:40,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:37:40,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:40,274 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] [2019-12-26 23:37:40,274 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:40,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:40,274 INFO L82 PathProgramCache]: Analyzing trace with hash -70181007, now seen corresponding path program 1 times [2019-12-26 23:37:40,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:40,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294314464] [2019-12-26 23:37:40,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:40,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:40,334 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-26 23:37:40,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294314464] [2019-12-26 23:37:40,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:40,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:37:40,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658465094] [2019-12-26 23:37:40,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:37:40,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:40,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:37:40,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:37:40,336 INFO L87 Difference]: Start difference. First operand 37601 states and 124116 transitions. Second operand 5 states. [2019-12-26 23:37:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:40,918 INFO L93 Difference]: Finished difference Result 50439 states and 163679 transitions. [2019-12-26 23:37:40,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:37:40,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:37:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:41,010 INFO L225 Difference]: With dead ends: 50439 [2019-12-26 23:37:41,010 INFO L226 Difference]: Without dead ends: 50137 [2019-12-26 23:37:41,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:37:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50137 states. [2019-12-26 23:37:43,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50137 to 38325. [2019-12-26 23:37:43,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38325 states. [2019-12-26 23:37:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38325 states to 38325 states and 126442 transitions. [2019-12-26 23:37:43,917 INFO L78 Accepts]: Start accepts. Automaton has 38325 states and 126442 transitions. Word has length 22 [2019-12-26 23:37:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:43,917 INFO L462 AbstractCegarLoop]: Abstraction has 38325 states and 126442 transitions. [2019-12-26 23:37:43,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:37:43,917 INFO L276 IsEmpty]: Start isEmpty. Operand 38325 states and 126442 transitions. [2019-12-26 23:37:43,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:37:43,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:43,925 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] [2019-12-26 23:37:43,925 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:43,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:43,925 INFO L82 PathProgramCache]: Analyzing trace with hash -633645132, now seen corresponding path program 1 times [2019-12-26 23:37:43,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:43,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601551371] [2019-12-26 23:37:43,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:43,996 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-26 23:37:43,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601551371] [2019-12-26 23:37:43,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:43,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:37:43,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702267387] [2019-12-26 23:37:43,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:37:43,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:37:43,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:37:43,998 INFO L87 Difference]: Start difference. First operand 38325 states and 126442 transitions. Second operand 5 states. [2019-12-26 23:37:44,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:44,593 INFO L93 Difference]: Finished difference Result 50758 states and 164508 transitions. [2019-12-26 23:37:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:37:44,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-26 23:37:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:44,684 INFO L225 Difference]: With dead ends: 50758 [2019-12-26 23:37:44,685 INFO L226 Difference]: Without dead ends: 50338 [2019-12-26 23:37:44,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:37:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50338 states. [2019-12-26 23:37:45,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50338 to 35870. [2019-12-26 23:37:45,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35870 states. [2019-12-26 23:37:45,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35870 states to 35870 states and 118280 transitions. [2019-12-26 23:37:45,838 INFO L78 Accepts]: Start accepts. Automaton has 35870 states and 118280 transitions. Word has length 22 [2019-12-26 23:37:45,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:45,838 INFO L462 AbstractCegarLoop]: Abstraction has 35870 states and 118280 transitions. [2019-12-26 23:37:45,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:37:45,839 INFO L276 IsEmpty]: Start isEmpty. Operand 35870 states and 118280 transitions. [2019-12-26 23:37:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:37:45,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:45,850 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-26 23:37:45,850 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:45,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:45,850 INFO L82 PathProgramCache]: Analyzing trace with hash 400071569, now seen corresponding path program 1 times [2019-12-26 23:37:45,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:45,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476013425] [2019-12-26 23:37:45,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:45,916 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-26 23:37:45,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476013425] [2019-12-26 23:37:45,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:45,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:37:45,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94533211] [2019-12-26 23:37:45,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:37:45,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:45,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:37:45,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:37:45,919 INFO L87 Difference]: Start difference. First operand 35870 states and 118280 transitions. Second operand 5 states. [2019-12-26 23:37:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:46,404 INFO L93 Difference]: Finished difference Result 49184 states and 158828 transitions. [2019-12-26 23:37:46,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:37:46,404 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-26 23:37:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:46,489 INFO L225 Difference]: With dead ends: 49184 [2019-12-26 23:37:46,490 INFO L226 Difference]: Without dead ends: 48744 [2019-12-26 23:37:46,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:37:46,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48744 states. [2019-12-26 23:37:47,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48744 to 39958. [2019-12-26 23:37:47,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-12-26 23:37:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 131043 transitions. [2019-12-26 23:37:47,247 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 131043 transitions. Word has length 25 [2019-12-26 23:37:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:47,247 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 131043 transitions. [2019-12-26 23:37:47,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:37:47,247 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 131043 transitions. [2019-12-26 23:37:47,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:37:47,265 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:47,265 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] [2019-12-26 23:37:47,265 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:47,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:47,266 INFO L82 PathProgramCache]: Analyzing trace with hash -819070516, now seen corresponding path program 1 times [2019-12-26 23:37:47,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:47,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912163908] [2019-12-26 23:37:47,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:47,372 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-26 23:37:47,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912163908] [2019-12-26 23:37:47,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:47,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:37:47,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551047915] [2019-12-26 23:37:47,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:37:47,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:47,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:37:47,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:37:47,375 INFO L87 Difference]: Start difference. First operand 39958 states and 131043 transitions. Second operand 5 states. [2019-12-26 23:37:48,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:48,218 INFO L93 Difference]: Finished difference Result 50424 states and 163757 transitions. [2019-12-26 23:37:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:37:48,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 23:37:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:48,312 INFO L225 Difference]: With dead ends: 50424 [2019-12-26 23:37:48,312 INFO L226 Difference]: Without dead ends: 50050 [2019-12-26 23:37:48,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:37:48,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50050 states. [2019-12-26 23:37:48,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50050 to 41737. [2019-12-26 23:37:48,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41737 states. [2019-12-26 23:37:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41737 states to 41737 states and 136855 transitions. [2019-12-26 23:37:49,085 INFO L78 Accepts]: Start accepts. Automaton has 41737 states and 136855 transitions. Word has length 28 [2019-12-26 23:37:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:49,085 INFO L462 AbstractCegarLoop]: Abstraction has 41737 states and 136855 transitions. [2019-12-26 23:37:49,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:37:49,086 INFO L276 IsEmpty]: Start isEmpty. Operand 41737 states and 136855 transitions. [2019-12-26 23:37:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:37:49,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:49,108 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] [2019-12-26 23:37:49,108 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:49,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:49,109 INFO L82 PathProgramCache]: Analyzing trace with hash 377940687, now seen corresponding path program 1 times [2019-12-26 23:37:49,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:49,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795718134] [2019-12-26 23:37:49,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:49,156 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-26 23:37:49,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795718134] [2019-12-26 23:37:49,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:49,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:37:49,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944679760] [2019-12-26 23:37:49,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:37:49,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:49,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:37:49,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:37:49,158 INFO L87 Difference]: Start difference. First operand 41737 states and 136855 transitions. Second operand 3 states. [2019-12-26 23:37:49,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:49,381 INFO L93 Difference]: Finished difference Result 52983 states and 172445 transitions. [2019-12-26 23:37:49,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:37:49,382 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-12-26 23:37:49,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:49,481 INFO L225 Difference]: With dead ends: 52983 [2019-12-26 23:37:49,482 INFO L226 Difference]: Without dead ends: 52983 [2019-12-26 23:37:49,482 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-26 23:37:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52983 states. [2019-12-26 23:37:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52983 to 43481. [2019-12-26 23:37:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43481 states. [2019-12-26 23:37:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43481 states to 43481 states and 140263 transitions. [2019-12-26 23:37:50,558 INFO L78 Accepts]: Start accepts. Automaton has 43481 states and 140263 transitions. Word has length 28 [2019-12-26 23:37:50,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:50,558 INFO L462 AbstractCegarLoop]: Abstraction has 43481 states and 140263 transitions. [2019-12-26 23:37:50,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:37:50,558 INFO L276 IsEmpty]: Start isEmpty. Operand 43481 states and 140263 transitions. [2019-12-26 23:37:50,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:37:50,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:50,578 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] [2019-12-26 23:37:50,578 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:50,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:50,579 INFO L82 PathProgramCache]: Analyzing trace with hash -589973380, now seen corresponding path program 1 times [2019-12-26 23:37:50,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:50,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769843174] [2019-12-26 23:37:50,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:50,649 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-26 23:37:50,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769843174] [2019-12-26 23:37:50,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:50,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:37:50,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275529420] [2019-12-26 23:37:50,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:37:50,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:50,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:37:50,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:37:50,652 INFO L87 Difference]: Start difference. First operand 43481 states and 140263 transitions. Second operand 5 states. [2019-12-26 23:37:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:51,276 INFO L93 Difference]: Finished difference Result 54179 states and 173086 transitions. [2019-12-26 23:37:51,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:37:51,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-12-26 23:37:51,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:51,430 INFO L225 Difference]: With dead ends: 54179 [2019-12-26 23:37:51,430 INFO L226 Difference]: Without dead ends: 53785 [2019-12-26 23:37:51,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:37:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53785 states. [2019-12-26 23:37:52,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53785 to 42787. [2019-12-26 23:37:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42787 states. [2019-12-26 23:37:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42787 states to 42787 states and 137824 transitions. [2019-12-26 23:37:52,974 INFO L78 Accepts]: Start accepts. Automaton has 42787 states and 137824 transitions. Word has length 29 [2019-12-26 23:37:52,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:52,974 INFO L462 AbstractCegarLoop]: Abstraction has 42787 states and 137824 transitions. [2019-12-26 23:37:52,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:37:52,974 INFO L276 IsEmpty]: Start isEmpty. Operand 42787 states and 137824 transitions. [2019-12-26 23:37:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 23:37:52,992 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:52,992 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] [2019-12-26 23:37:52,992 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:52,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:52,993 INFO L82 PathProgramCache]: Analyzing trace with hash -934002539, now seen corresponding path program 1 times [2019-12-26 23:37:52,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:52,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084564981] [2019-12-26 23:37:52,994 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:53,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:53,038 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-26 23:37:53,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084564981] [2019-12-26 23:37:53,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:53,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:37:53,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086511467] [2019-12-26 23:37:53,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:37:53,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:37:53,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:37:53,040 INFO L87 Difference]: Start difference. First operand 42787 states and 137824 transitions. Second operand 3 states. [2019-12-26 23:37:53,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:53,254 INFO L93 Difference]: Finished difference Result 62369 states and 203785 transitions. [2019-12-26 23:37:53,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:37:53,255 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-26 23:37:53,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:53,307 INFO L225 Difference]: With dead ends: 62369 [2019-12-26 23:37:53,307 INFO L226 Difference]: Without dead ends: 27708 [2019-12-26 23:37:53,307 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-26 23:37:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27708 states. [2019-12-26 23:37:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27708 to 26920. [2019-12-26 23:37:53,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26920 states. [2019-12-26 23:37:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26920 states to 26920 states and 86266 transitions. [2019-12-26 23:37:53,787 INFO L78 Accepts]: Start accepts. Automaton has 26920 states and 86266 transitions. Word has length 29 [2019-12-26 23:37:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:53,787 INFO L462 AbstractCegarLoop]: Abstraction has 26920 states and 86266 transitions. [2019-12-26 23:37:53,788 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:37:53,788 INFO L276 IsEmpty]: Start isEmpty. Operand 26920 states and 86266 transitions. [2019-12-26 23:37:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:37:53,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:53,800 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] [2019-12-26 23:37:53,800 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:53,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:53,801 INFO L82 PathProgramCache]: Analyzing trace with hash -2124026772, now seen corresponding path program 1 times [2019-12-26 23:37:53,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:53,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882580752] [2019-12-26 23:37:53,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:53,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:53,847 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-26 23:37:53,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882580752] [2019-12-26 23:37:53,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:53,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:37:53,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615695983] [2019-12-26 23:37:53,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:37:53,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:53,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:37:53,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:37:53,850 INFO L87 Difference]: Start difference. First operand 26920 states and 86266 transitions. Second operand 4 states. [2019-12-26 23:37:54,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:54,012 INFO L93 Difference]: Finished difference Result 44120 states and 145060 transitions. [2019-12-26 23:37:54,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:37:54,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-12-26 23:37:54,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:54,049 INFO L225 Difference]: With dead ends: 44120 [2019-12-26 23:37:54,050 INFO L226 Difference]: Without dead ends: 21429 [2019-12-26 23:37:54,050 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-26 23:37:54,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21429 states. [2019-12-26 23:37:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21429 to 20333. [2019-12-26 23:37:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20333 states. [2019-12-26 23:37:54,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20333 states to 20333 states and 67715 transitions. [2019-12-26 23:37:54,629 INFO L78 Accepts]: Start accepts. Automaton has 20333 states and 67715 transitions. Word has length 30 [2019-12-26 23:37:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:54,629 INFO L462 AbstractCegarLoop]: Abstraction has 20333 states and 67715 transitions. [2019-12-26 23:37:54,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:37:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 20333 states and 67715 transitions. [2019-12-26 23:37:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:37:54,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:54,640 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] [2019-12-26 23:37:54,640 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:54,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:54,640 INFO L82 PathProgramCache]: Analyzing trace with hash -936488553, now seen corresponding path program 1 times [2019-12-26 23:37:54,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:54,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181682051] [2019-12-26 23:37:54,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:54,711 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-26 23:37:54,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181682051] [2019-12-26 23:37:54,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:54,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:37:54,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545837499] [2019-12-26 23:37:54,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:37:54,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:54,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:37:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:37:54,713 INFO L87 Difference]: Start difference. First operand 20333 states and 67715 transitions. Second operand 5 states. [2019-12-26 23:37:55,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:55,279 INFO L93 Difference]: Finished difference Result 34767 states and 112990 transitions. [2019-12-26 23:37:55,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:37:55,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-26 23:37:55,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:55,334 INFO L225 Difference]: With dead ends: 34767 [2019-12-26 23:37:55,334 INFO L226 Difference]: Without dead ends: 34767 [2019-12-26 23:37:55,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:37:55,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34767 states. [2019-12-26 23:37:55,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34767 to 29090. [2019-12-26 23:37:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29090 states. [2019-12-26 23:37:55,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29090 states to 29090 states and 95089 transitions. [2019-12-26 23:37:55,889 INFO L78 Accepts]: Start accepts. Automaton has 29090 states and 95089 transitions. Word has length 30 [2019-12-26 23:37:55,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:55,889 INFO L462 AbstractCegarLoop]: Abstraction has 29090 states and 95089 transitions. [2019-12-26 23:37:55,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:37:55,890 INFO L276 IsEmpty]: Start isEmpty. Operand 29090 states and 95089 transitions. [2019-12-26 23:37:55,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:37:55,910 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:55,910 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] [2019-12-26 23:37:55,910 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:55,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:55,910 INFO L82 PathProgramCache]: Analyzing trace with hash -1151300207, now seen corresponding path program 1 times [2019-12-26 23:37:55,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:55,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187240236] [2019-12-26 23:37:55,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:55,975 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-26 23:37:55,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187240236] [2019-12-26 23:37:55,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:55,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:37:55,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481774873] [2019-12-26 23:37:55,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:37:55,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:55,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:37:55,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:37:55,977 INFO L87 Difference]: Start difference. First operand 29090 states and 95089 transitions. Second operand 5 states. [2019-12-26 23:37:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:56,067 INFO L93 Difference]: Finished difference Result 13178 states and 39760 transitions. [2019-12-26 23:37:56,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:37:56,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 23:37:56,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:56,087 INFO L225 Difference]: With dead ends: 13178 [2019-12-26 23:37:56,088 INFO L226 Difference]: Without dead ends: 11110 [2019-12-26 23:37:56,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:37:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11110 states. [2019-12-26 23:37:56,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11110 to 10943. [2019-12-26 23:37:56,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10943 states. [2019-12-26 23:37:56,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10943 states to 10943 states and 32777 transitions. [2019-12-26 23:37:56,261 INFO L78 Accepts]: Start accepts. Automaton has 10943 states and 32777 transitions. Word has length 31 [2019-12-26 23:37:56,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:56,261 INFO L462 AbstractCegarLoop]: Abstraction has 10943 states and 32777 transitions. [2019-12-26 23:37:56,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:37:56,261 INFO L276 IsEmpty]: Start isEmpty. Operand 10943 states and 32777 transitions. [2019-12-26 23:37:56,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:37:56,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:56,271 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] [2019-12-26 23:37:56,271 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:56,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:56,272 INFO L82 PathProgramCache]: Analyzing trace with hash -134226549, now seen corresponding path program 1 times [2019-12-26 23:37:56,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:56,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539292645] [2019-12-26 23:37:56,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:56,348 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-26 23:37:56,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539292645] [2019-12-26 23:37:56,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:56,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:37:56,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066285733] [2019-12-26 23:37:56,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:37:56,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:56,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:37:56,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:37:56,350 INFO L87 Difference]: Start difference. First operand 10943 states and 32777 transitions. Second operand 6 states. [2019-12-26 23:37:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:56,567 INFO L93 Difference]: Finished difference Result 11069 states and 33011 transitions. [2019-12-26 23:37:56,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:37:56,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:37:56,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:56,583 INFO L225 Difference]: With dead ends: 11069 [2019-12-26 23:37:56,584 INFO L226 Difference]: Without dead ends: 10842 [2019-12-26 23:37:56,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:37:56,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10842 states. [2019-12-26 23:37:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10842 to 10842. [2019-12-26 23:37:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10842 states. [2019-12-26 23:37:56,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10842 states to 10842 states and 32566 transitions. [2019-12-26 23:37:56,845 INFO L78 Accepts]: Start accepts. Automaton has 10842 states and 32566 transitions. Word has length 40 [2019-12-26 23:37:56,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:56,845 INFO L462 AbstractCegarLoop]: Abstraction has 10842 states and 32566 transitions. [2019-12-26 23:37:56,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:37:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 10842 states and 32566 transitions. [2019-12-26 23:37:56,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:37:56,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:56,857 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] [2019-12-26 23:37:56,857 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:56,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:56,857 INFO L82 PathProgramCache]: Analyzing trace with hash 809189858, now seen corresponding path program 1 times [2019-12-26 23:37:56,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:56,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996331206] [2019-12-26 23:37:56,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:56,933 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-26 23:37:56,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996331206] [2019-12-26 23:37:56,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:56,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:37:56,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112456634] [2019-12-26 23:37:56,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:37:56,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:56,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:37:56,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:37:56,935 INFO L87 Difference]: Start difference. First operand 10842 states and 32566 transitions. Second operand 6 states. [2019-12-26 23:37:57,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:57,742 INFO L93 Difference]: Finished difference Result 20964 states and 62804 transitions. [2019-12-26 23:37:57,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:37:57,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:37:57,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:57,788 INFO L225 Difference]: With dead ends: 20964 [2019-12-26 23:37:57,789 INFO L226 Difference]: Without dead ends: 20964 [2019-12-26 23:37:57,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:37:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20964 states. [2019-12-26 23:37:58,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20964 to 13761. [2019-12-26 23:37:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2019-12-26 23:37:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 41473 transitions. [2019-12-26 23:37:58,132 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 41473 transitions. Word has length 40 [2019-12-26 23:37:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:58,132 INFO L462 AbstractCegarLoop]: Abstraction has 13761 states and 41473 transitions. [2019-12-26 23:37:58,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:37:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 41473 transitions. [2019-12-26 23:37:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:37:58,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:58,147 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] [2019-12-26 23:37:58,148 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:58,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:58,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2114152388, now seen corresponding path program 2 times [2019-12-26 23:37:58,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:58,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181295437] [2019-12-26 23:37:58,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:58,204 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-26 23:37:58,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181295437] [2019-12-26 23:37:58,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:58,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:37:58,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341009838] [2019-12-26 23:37:58,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:37:58,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:58,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:37:58,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:37:58,206 INFO L87 Difference]: Start difference. First operand 13761 states and 41473 transitions. Second operand 3 states. [2019-12-26 23:37:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:58,268 INFO L93 Difference]: Finished difference Result 13681 states and 41186 transitions. [2019-12-26 23:37:58,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:37:58,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 23:37:58,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:58,295 INFO L225 Difference]: With dead ends: 13681 [2019-12-26 23:37:58,296 INFO L226 Difference]: Without dead ends: 13681 [2019-12-26 23:37:58,302 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-26 23:37:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13681 states. [2019-12-26 23:37:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13681 to 11316. [2019-12-26 23:37:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11316 states. [2019-12-26 23:37:58,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11316 states to 11316 states and 34446 transitions. [2019-12-26 23:37:58,638 INFO L78 Accepts]: Start accepts. Automaton has 11316 states and 34446 transitions. Word has length 40 [2019-12-26 23:37:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:58,638 INFO L462 AbstractCegarLoop]: Abstraction has 11316 states and 34446 transitions. [2019-12-26 23:37:58,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:37:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 11316 states and 34446 transitions. [2019-12-26 23:37:58,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:37:58,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:58,660 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] [2019-12-26 23:37:58,660 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:58,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:58,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1136448647, now seen corresponding path program 1 times [2019-12-26 23:37:58,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:58,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141322584] [2019-12-26 23:37:58,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:58,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:58,764 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-26 23:37:58,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141322584] [2019-12-26 23:37:58,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:58,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:37:58,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114003540] [2019-12-26 23:37:58,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:37:58,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:58,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:37:58,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:37:58,771 INFO L87 Difference]: Start difference. First operand 11316 states and 34446 transitions. Second operand 6 states. [2019-12-26 23:37:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:59,053 INFO L93 Difference]: Finished difference Result 11302 states and 34413 transitions. [2019-12-26 23:37:59,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:37:59,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:37:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:59,073 INFO L225 Difference]: With dead ends: 11302 [2019-12-26 23:37:59,073 INFO L226 Difference]: Without dead ends: 10961 [2019-12-26 23:37:59,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:37:59,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10961 states. [2019-12-26 23:37:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10961 to 10961. [2019-12-26 23:37:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10961 states. [2019-12-26 23:37:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10961 states to 10961 states and 33758 transitions. [2019-12-26 23:37:59,307 INFO L78 Accepts]: Start accepts. Automaton has 10961 states and 33758 transitions. Word has length 41 [2019-12-26 23:37:59,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:59,307 INFO L462 AbstractCegarLoop]: Abstraction has 10961 states and 33758 transitions. [2019-12-26 23:37:59,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:37:59,307 INFO L276 IsEmpty]: Start isEmpty. Operand 10961 states and 33758 transitions. [2019-12-26 23:37:59,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:37:59,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:59,322 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] [2019-12-26 23:37:59,322 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1425122982, now seen corresponding path program 1 times [2019-12-26 23:37:59,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:59,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434202584] [2019-12-26 23:37:59,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:59,391 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-26 23:37:59,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434202584] [2019-12-26 23:37:59,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:59,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:37:59,392 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050863580] [2019-12-26 23:37:59,392 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:37:59,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:59,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:37:59,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:37:59,393 INFO L87 Difference]: Start difference. First operand 10961 states and 33758 transitions. Second operand 3 states. [2019-12-26 23:37:59,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:59,433 INFO L93 Difference]: Finished difference Result 8341 states and 25037 transitions. [2019-12-26 23:37:59,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:37:59,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-26 23:37:59,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:59,447 INFO L225 Difference]: With dead ends: 8341 [2019-12-26 23:37:59,447 INFO L226 Difference]: Without dead ends: 8341 [2019-12-26 23:37:59,448 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-26 23:37:59,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8341 states. [2019-12-26 23:37:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8341 to 8202. [2019-12-26 23:37:59,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8202 states. [2019-12-26 23:37:59,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8202 states to 8202 states and 24638 transitions. [2019-12-26 23:37:59,568 INFO L78 Accepts]: Start accepts. Automaton has 8202 states and 24638 transitions. Word has length 41 [2019-12-26 23:37:59,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:59,568 INFO L462 AbstractCegarLoop]: Abstraction has 8202 states and 24638 transitions. [2019-12-26 23:37:59,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:37:59,568 INFO L276 IsEmpty]: Start isEmpty. Operand 8202 states and 24638 transitions. [2019-12-26 23:37:59,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 23:37:59,576 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:59,577 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] [2019-12-26 23:37:59,577 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:59,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:59,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1119333898, now seen corresponding path program 1 times [2019-12-26 23:37:59,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:59,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29494005] [2019-12-26 23:37:59,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:59,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:59,640 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-26 23:37:59,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29494005] [2019-12-26 23:37:59,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:59,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:37:59,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042069407] [2019-12-26 23:37:59,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:37:59,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:37:59,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:37:59,642 INFO L87 Difference]: Start difference. First operand 8202 states and 24638 transitions. Second operand 6 states. [2019-12-26 23:37:59,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:37:59,727 INFO L93 Difference]: Finished difference Result 7285 states and 22413 transitions. [2019-12-26 23:37:59,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:37:59,728 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-26 23:37:59,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:37:59,742 INFO L225 Difference]: With dead ends: 7285 [2019-12-26 23:37:59,742 INFO L226 Difference]: Without dead ends: 7186 [2019-12-26 23:37:59,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:37:59,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7186 states. [2019-12-26 23:37:59,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7186 to 7144. [2019-12-26 23:37:59,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7144 states. [2019-12-26 23:37:59,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7144 states to 7144 states and 22071 transitions. [2019-12-26 23:37:59,875 INFO L78 Accepts]: Start accepts. Automaton has 7144 states and 22071 transitions. Word has length 42 [2019-12-26 23:37:59,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:37:59,875 INFO L462 AbstractCegarLoop]: Abstraction has 7144 states and 22071 transitions. [2019-12-26 23:37:59,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:37:59,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7144 states and 22071 transitions. [2019-12-26 23:37:59,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:37:59,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:37:59,884 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] [2019-12-26 23:37:59,884 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:37:59,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:37:59,884 INFO L82 PathProgramCache]: Analyzing trace with hash 259489780, now seen corresponding path program 1 times [2019-12-26 23:37:59,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:37:59,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288997019] [2019-12-26 23:37:59,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:37:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:37:59,979 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-26 23:37:59,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288997019] [2019-12-26 23:37:59,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:37:59,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:37:59,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339302323] [2019-12-26 23:37:59,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:37:59,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:37:59,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:37:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:37:59,981 INFO L87 Difference]: Start difference. First operand 7144 states and 22071 transitions. Second operand 9 states. [2019-12-26 23:38:00,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:38:00,938 INFO L93 Difference]: Finished difference Result 13874 states and 41968 transitions. [2019-12-26 23:38:00,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 23:38:00,939 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-26 23:38:00,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:38:00,953 INFO L225 Difference]: With dead ends: 13874 [2019-12-26 23:38:00,953 INFO L226 Difference]: Without dead ends: 9201 [2019-12-26 23:38:00,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:38:00,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9201 states. [2019-12-26 23:38:01,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9201 to 8617. [2019-12-26 23:38:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8617 states. [2019-12-26 23:38:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8617 states to 8617 states and 25970 transitions. [2019-12-26 23:38:01,079 INFO L78 Accepts]: Start accepts. Automaton has 8617 states and 25970 transitions. Word has length 56 [2019-12-26 23:38:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:38:01,080 INFO L462 AbstractCegarLoop]: Abstraction has 8617 states and 25970 transitions. [2019-12-26 23:38:01,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:38:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 8617 states and 25970 transitions. [2019-12-26 23:38:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:38:01,090 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:38:01,090 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] [2019-12-26 23:38:01,090 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:38:01,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:38:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash 425157206, now seen corresponding path program 2 times [2019-12-26 23:38:01,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:38:01,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219422525] [2019-12-26 23:38:01,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:38:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:38:01,299 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-26 23:38:01,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219422525] [2019-12-26 23:38:01,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:38:01,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:38:01,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235577985] [2019-12-26 23:38:01,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:38:01,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:38:01,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:38:01,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:38:01,301 INFO L87 Difference]: Start difference. First operand 8617 states and 25970 transitions. Second operand 11 states. [2019-12-26 23:38:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:38:02,158 INFO L93 Difference]: Finished difference Result 13173 states and 39625 transitions. [2019-12-26 23:38:02,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 23:38:02,159 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 23:38:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:38:02,179 INFO L225 Difference]: With dead ends: 13173 [2019-12-26 23:38:02,179 INFO L226 Difference]: Without dead ends: 12479 [2019-12-26 23:38:02,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:38:02,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12479 states. [2019-12-26 23:38:02,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12479 to 11519. [2019-12-26 23:38:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11519 states. [2019-12-26 23:38:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11519 states to 11519 states and 34736 transitions. [2019-12-26 23:38:02,360 INFO L78 Accepts]: Start accepts. Automaton has 11519 states and 34736 transitions. Word has length 56 [2019-12-26 23:38:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:38:02,361 INFO L462 AbstractCegarLoop]: Abstraction has 11519 states and 34736 transitions. [2019-12-26 23:38:02,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:38:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 11519 states and 34736 transitions. [2019-12-26 23:38:02,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:38:02,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:38:02,372 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] [2019-12-26 23:38:02,372 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:38:02,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:38:02,372 INFO L82 PathProgramCache]: Analyzing trace with hash 2122420018, now seen corresponding path program 3 times [2019-12-26 23:38:02,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:38:02,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546212742] [2019-12-26 23:38:02,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:38:02,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:38:02,530 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-26 23:38:02,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546212742] [2019-12-26 23:38:02,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:38:02,531 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:38:02,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12999893] [2019-12-26 23:38:02,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:38:02,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:38:02,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:38:02,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:38:02,532 INFO L87 Difference]: Start difference. First operand 11519 states and 34736 transitions. Second operand 11 states. [2019-12-26 23:38:03,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:38:03,258 INFO L93 Difference]: Finished difference Result 12697 states and 37705 transitions. [2019-12-26 23:38:03,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:38:03,259 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 23:38:03,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:38:03,273 INFO L225 Difference]: With dead ends: 12697 [2019-12-26 23:38:03,273 INFO L226 Difference]: Without dead ends: 9374 [2019-12-26 23:38:03,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=509, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:38:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9374 states. [2019-12-26 23:38:03,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9374 to 8500. [2019-12-26 23:38:03,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8500 states. [2019-12-26 23:38:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8500 states to 8500 states and 25452 transitions. [2019-12-26 23:38:03,402 INFO L78 Accepts]: Start accepts. Automaton has 8500 states and 25452 transitions. Word has length 56 [2019-12-26 23:38:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:38:03,402 INFO L462 AbstractCegarLoop]: Abstraction has 8500 states and 25452 transitions. [2019-12-26 23:38:03,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:38:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 8500 states and 25452 transitions. [2019-12-26 23:38:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:38:03,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:38:03,411 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] [2019-12-26 23:38:03,411 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:38:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:38:03,411 INFO L82 PathProgramCache]: Analyzing trace with hash 918799478, now seen corresponding path program 4 times [2019-12-26 23:38:03,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:38:03,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530288370] [2019-12-26 23:38:03,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:38:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:38:03,589 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-26 23:38:03,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530288370] [2019-12-26 23:38:03,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:38:03,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:38:03,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463589180] [2019-12-26 23:38:03,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:38:03,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:38:03,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:38:03,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:38:03,591 INFO L87 Difference]: Start difference. First operand 8500 states and 25452 transitions. Second operand 12 states. [2019-12-26 23:38:04,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:38:04,470 INFO L93 Difference]: Finished difference Result 9694 states and 28451 transitions. [2019-12-26 23:38:04,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:38:04,471 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-26 23:38:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:38:04,487 INFO L225 Difference]: With dead ends: 9694 [2019-12-26 23:38:04,488 INFO L226 Difference]: Without dead ends: 9134 [2019-12-26 23:38:04,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 23:38:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9134 states. [2019-12-26 23:38:04,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9134 to 8252. [2019-12-26 23:38:04,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8252 states. [2019-12-26 23:38:04,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8252 states to 8252 states and 24782 transitions. [2019-12-26 23:38:04,685 INFO L78 Accepts]: Start accepts. Automaton has 8252 states and 24782 transitions. Word has length 56 [2019-12-26 23:38:04,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:38:04,685 INFO L462 AbstractCegarLoop]: Abstraction has 8252 states and 24782 transitions. [2019-12-26 23:38:04,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:38:04,685 INFO L276 IsEmpty]: Start isEmpty. Operand 8252 states and 24782 transitions. [2019-12-26 23:38:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:38:04,696 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:38:04,697 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] [2019-12-26 23:38:04,697 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:38:04,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:38:04,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1649345490, now seen corresponding path program 5 times [2019-12-26 23:38:04,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:38:04,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434176085] [2019-12-26 23:38:04,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:38:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:38:04,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:38:04,867 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:38:04,868 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:38:04,871 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff1_thd1~0_448 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x$w_buff1_used~0_643) (= 0 v_~x~0_243) (= v_~__unbuffered_p2_EBX~0_64 0) (= 0 v_~__unbuffered_p0_EAX~0_82) (= 0 v_~x$r_buff1_thd2~0_283) (= v_~x$flush_delayed~0_67 0) (= 0 v_~__unbuffered_p2_EAX~0_64) (= (select .cse0 |v_ULTIMATE.start_main_~#t1903~0.base_26|) 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1903~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1903~0.base_26|) |v_ULTIMATE.start_main_~#t1903~0.offset_20| 0)) |v_#memory_int_23|) (= v_~main$tmp_guard1~0_51 0) (= v_~main$tmp_guard0~0_41 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 |v_ULTIMATE.start_main_~#t1903~0.offset_20|) (= v_~x$r_buff1_thd0~0_322 0) (= 0 v_~x$w_buff1~0_350) (= v_~weak$$choice2~0_208 0) (= 0 v_~x$w_buff0~0_432) (= 0 v_~x$read_delayed~0_6) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$r_buff0_thd3~0_150) (= v_~x$r_buff0_thd1~0_385 0) (= 0 v_~x$r_buff1_thd3~0_288) (= v_~x$mem_tmp~0_44 0) (= 0 v_~x$r_buff0_thd2~0_345) (= |v_#NULL.offset_5| 0) (= 0 v_~x$w_buff0_used~0_952) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1903~0.base_26|) (= v_~x$r_buff0_thd0~0_164 0) (= 0 v_~weak$$choice0~0_40) (= v_~y~0_300 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t1903~0.base_26| 1)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1903~0.base_26| 4)) (= 0 |v_#NULL.base_5|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_432, ~x$flush_delayed~0=v_~x$flush_delayed~0_67, ULTIMATE.start_main_~#t1904~0.offset=|v_ULTIMATE.start_main_~#t1904~0.offset_20|, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_448, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_150, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_82, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_64, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_164, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_64, ~x$w_buff1~0=v_~x$w_buff1~0_350, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_643, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_283, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_40, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ULTIMATE.start_main_~#t1905~0.base=|v_ULTIMATE.start_main_~#t1905~0.base_21|, ~x~0=v_~x~0_243, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_385, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_106|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ~x$mem_tmp~0=v_~x$mem_tmp~0_44, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t1904~0.base=|v_ULTIMATE.start_main_~#t1904~0.base_27|, ULTIMATE.start_main_~#t1905~0.offset=|v_ULTIMATE.start_main_~#t1905~0.offset_14|, ~y~0=v_~y~0_300, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_41, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_322, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_345, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_~#t1903~0.base=|v_ULTIMATE.start_main_~#t1903~0.base_26|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_952, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t1903~0.offset=|v_ULTIMATE.start_main_~#t1903~0.offset_20|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~weak$$choice2~0=v_~weak$$choice2~0_208, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_~#t1904~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1904~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1905~0.offset, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p2_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_~#t1903~0.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~nondet38, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1903~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1905~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:38:04,872 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L818-1-->L820: Formula: (and (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1904~0.base_10|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1904~0.base_10|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1904~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t1904~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1904~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1904~0.base_10|) |v_ULTIMATE.start_main_~#t1904~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t1904~0.offset_9| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1904~0.base_10| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1904~0.base=|v_ULTIMATE.start_main_~#t1904~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1904~0.offset=|v_ULTIMATE.start_main_~#t1904~0.offset_9|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1904~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1904~0.offset, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-26 23:38:04,873 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] P1ENTRY-->L5-3: Formula: (and (= (mod v_~x$w_buff1_used~0_45 256) 0) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|) (= 1 v_~x$w_buff0_used~0_82) (= v_P1Thread1of1ForFork0_~arg.offset_8 |v_P1Thread1of1ForFork0_#in~arg.offset_8|) (= v_~x$w_buff1_used~0_45 v_~x$w_buff0_used~0_83) (= v_~x$w_buff0~0_23 v_~x$w_buff1~0_17) (= v_P1Thread1of1ForFork0_~arg.base_8 |v_P1Thread1of1ForFork0_#in~arg.base_8|) (= 1 v_~x$w_buff0~0_22) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_23, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_83} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_22, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_10, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_8, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_8, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_8|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_8|, ~x$w_buff1~0=v_~x$w_buff1~0_17, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_8|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_45, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_82} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:38:04,874 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L820-1-->L822: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1905~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1905~0.offset_10| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1905~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1905~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1905~0.base_11|) |v_ULTIMATE.start_main_~#t1905~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1905~0.base_11|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1905~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1905~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1905~0.offset=|v_ULTIMATE.start_main_~#t1905~0.offset_10|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t1905~0.base=|v_ULTIMATE.start_main_~#t1905~0.base_11|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_~#t1905~0.offset, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t1905~0.base] because there is no mapped edge [2019-12-26 23:38:04,879 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In-751803961 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-751803961 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-751803961| ~x$w_buff1~0_In-751803961) (not .cse0) (not .cse1)) (and (= ~x~0_In-751803961 |P2Thread1of1ForFork1_#t~ite32_Out-751803961|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-751803961, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-751803961, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-751803961, ~x~0=~x~0_In-751803961} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-751803961|, ~x$w_buff1~0=~x$w_buff1~0_In-751803961, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-751803961, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-751803961, ~x~0=~x~0_In-751803961} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:38:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L795-4-->L796: Formula: (= v_~x~0_18 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:38:04,880 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In969383384 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In969383384 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out969383384| ~x$w_buff0_used~0_In969383384) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite34_Out969383384| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In969383384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In969383384} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out969383384|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In969383384, ~x$w_buff0_used~0=~x$w_buff0_used~0_In969383384} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:38:04,883 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L740-->L740-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2117669563 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite8_In2117669563| |P0Thread1of1ForFork2_#t~ite8_Out2117669563|) (not .cse0) (= ~x$w_buff0~0_In2117669563 |P0Thread1of1ForFork2_#t~ite9_Out2117669563|)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out2117669563| ~x$w_buff0~0_In2117669563) .cse0 (= |P0Thread1of1ForFork2_#t~ite8_Out2117669563| |P0Thread1of1ForFork2_#t~ite9_Out2117669563|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In2117669563 256) 0))) (or (and .cse1 (= (mod ~x$w_buff1_used~0_In2117669563 256) 0)) (and (= 0 (mod ~x$r_buff1_thd1~0_In2117669563 256)) .cse1) (= 0 (mod ~x$w_buff0_used~0_In2117669563 256))))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In2117669563, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2117669563, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In2117669563|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2117669563, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2117669563, ~weak$$choice2~0=~weak$$choice2~0_In2117669563, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2117669563} OutVars{~x$w_buff0~0=~x$w_buff0~0_In2117669563, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2117669563, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out2117669563|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2117669563, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out2117669563|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2117669563, ~weak$$choice2~0=~weak$$choice2~0_In2117669563, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2117669563} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:38:04,885 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-149871269 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-149871269 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-149871269| ~x$w_buff0_used~0_In-149871269) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite28_Out-149871269| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-149871269, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-149871269} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-149871269, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-149871269|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-149871269} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:38:04,886 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L777-->L777-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In-1833179641 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In-1833179641 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-1833179641 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1833179641 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out-1833179641| ~x$w_buff1_used~0_In-1833179641) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite29_Out-1833179641| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1833179641, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1833179641, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1833179641, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1833179641} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1833179641, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1833179641, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1833179641, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-1833179641|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1833179641} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:38:04,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L778-->L779: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-2002030173 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-2002030173 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In-2002030173 ~x$r_buff0_thd2~0_Out-2002030173)) (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out-2002030173) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2002030173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002030173} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-2002030173|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-2002030173, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2002030173} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:38:04,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In-1734914559 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1734914559 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1734914559 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1734914559 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite31_Out-1734914559| 0)) (and (or .cse3 .cse2) (= |P1Thread1of1ForFork0_#t~ite31_Out-1734914559| ~x$r_buff1_thd2~0_In-1734914559) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1734914559, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1734914559, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1734914559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1734914559} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1734914559|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1734914559, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1734914559, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1734914559, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1734914559} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:38:04,887 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L779-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_52 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 23:38:04,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd3~0_In1474557318 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In1474557318 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1474557318 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In1474557318 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1474557318 |P2Thread1of1ForFork1_#t~ite35_Out1474557318|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out1474557318|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1474557318, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1474557318, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1474557318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1474557318} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out1474557318|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1474557318, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1474557318, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1474557318, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1474557318} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:38:04,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In-1824553046 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1824553046 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out-1824553046| 0)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out-1824553046| ~x$r_buff0_thd3~0_In-1824553046) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1824553046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1824553046} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out-1824553046|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1824553046, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1824553046} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:38:04,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1056074105 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite17_In1056074105| |P0Thread1of1ForFork2_#t~ite17_Out1056074105|) (= |P0Thread1of1ForFork2_#t~ite18_Out1056074105| ~x$w_buff1_used~0_In1056074105)) (and (= |P0Thread1of1ForFork2_#t~ite18_Out1056074105| |P0Thread1of1ForFork2_#t~ite17_Out1056074105|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1056074105 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1056074105 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In1056074105 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In1056074105 256)) .cse1))) .cse0 (= ~x$w_buff1_used~0_In1056074105 |P0Thread1of1ForFork2_#t~ite17_Out1056074105|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1056074105, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1056074105|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1056074105, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1056074105, ~weak$$choice2~0=~weak$$choice2~0_In1056074105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1056074105} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1056074105, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1056074105|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1056074105|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1056074105, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1056074105, ~weak$$choice2~0=~weak$$choice2~0_In1056074105, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1056074105} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:38:04,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_104 v_~x$r_buff0_thd1~0_103) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_103, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_13|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:38:04,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1000037622 256)))) (or (and (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-1000037622 256) 0))) (or (and (= 0 (mod ~x$r_buff1_thd1~0_In-1000037622 256)) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-1000037622 256)) (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1000037622 256))))) (= |P0Thread1of1ForFork2_#t~ite24_Out-1000037622| |P0Thread1of1ForFork2_#t~ite23_Out-1000037622|) (= ~x$r_buff1_thd1~0_In-1000037622 |P0Thread1of1ForFork2_#t~ite23_Out-1000037622|) .cse1) (and (= |P0Thread1of1ForFork2_#t~ite23_In-1000037622| |P0Thread1of1ForFork2_#t~ite23_Out-1000037622|) (= ~x$r_buff1_thd1~0_In-1000037622 |P0Thread1of1ForFork2_#t~ite24_Out-1000037622|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1000037622, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1000037622, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1000037622, ~weak$$choice2~0=~weak$$choice2~0_In-1000037622, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-1000037622|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1000037622} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1000037622, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1000037622, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1000037622, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-1000037622|, ~weak$$choice2~0=~weak$$choice2~0_In-1000037622, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-1000037622|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1000037622} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:38:04,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In-1669297029 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In-1669297029 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1669297029 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd3~0_In-1669297029 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out-1669297029| ~x$r_buff1_thd3~0_In-1669297029)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite37_Out-1669297029| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669297029, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1669297029, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1669297029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1669297029} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out-1669297029|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1669297029, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1669297029, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1669297029, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1669297029} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:38:04,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_54 |v_P2Thread1of1ForFork1_#t~ite37_30|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_54, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 23:38:04,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10) (= (+ v_~__unbuffered_cnt~0_30 1) v_~__unbuffered_cnt~0_29)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:38:04,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [698] [698] L826-->L828-2: Formula: (and (or (= 0 (mod v_~x$w_buff0_used~0_172 256)) (= (mod v_~x$r_buff0_thd0~0_29 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_172} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:38:04,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L828-2-->L828-4: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In732902260 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In732902260 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out732902260| ~x$w_buff1~0_In732902260)) (and (= ~x~0_In732902260 |ULTIMATE.start_main_#t~ite41_Out732902260|) (or .cse0 .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In732902260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732902260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In732902260, ~x~0=~x~0_In732902260} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out732902260|, ~x$w_buff1~0=~x$w_buff1~0_In732902260, ~x$w_buff1_used~0=~x$w_buff1_used~0_In732902260, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In732902260, ~x~0=~x~0_In732902260} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:38:04,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L828-4-->L829: Formula: (= v_~x~0_24 |v_ULTIMATE.start_main_#t~ite41_11|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_11|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 23:38:04,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1037854291 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1037854291 256)))) (or (and (= ~x$w_buff0_used~0_In-1037854291 |ULTIMATE.start_main_#t~ite43_Out-1037854291|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1037854291|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1037854291, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1037854291} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1037854291, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1037854291|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1037854291} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:38:04,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L830-->L830-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In1452179367 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1452179367 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In1452179367 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1452179367 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In1452179367 |ULTIMATE.start_main_#t~ite44_Out1452179367|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite44_Out1452179367| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1452179367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1452179367, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1452179367, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1452179367} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1452179367, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1452179367, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1452179367, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1452179367|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1452179367} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:38:04,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In19775374 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In19775374 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out19775374| 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd0~0_In19775374 |ULTIMATE.start_main_#t~ite45_Out19775374|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In19775374, ~x$w_buff0_used~0=~x$w_buff0_used~0_In19775374} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In19775374, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out19775374|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In19775374} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:38:04,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-428771048 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-428771048 256))) (.cse3 (= (mod ~x$r_buff0_thd0~0_In-428771048 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-428771048 256)))) (or (and (= |ULTIMATE.start_main_#t~ite46_Out-428771048| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite46_Out-428771048| ~x$r_buff1_thd0~0_In-428771048) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-428771048, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-428771048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-428771048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-428771048} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-428771048, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-428771048|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-428771048, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-428771048, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-428771048} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:38:04,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [800] [800] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_26 0) (= v_~y~0_272 2) (= v_~x$r_buff1_thd0~0_293 |v_ULTIMATE.start_main_#t~ite46_58|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_14| (mod v_~main$tmp_guard1~0_26 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 0 v_~__unbuffered_p0_EAX~0_53) (= v_~__unbuffered_p2_EBX~0_34 1) (= 1 v_~__unbuffered_p2_EAX~0_34)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_58|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_53, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_34, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_57|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~y~0=v_~y~0_272, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_293, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_14|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:38:05,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:38:05 BasicIcfg [2019-12-26 23:38:05,054 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:38:05,055 INFO L168 Benchmark]: Toolchain (without parser) took 178037.68 ms. Allocated memory was 144.2 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.4 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 23:38:05,056 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 144.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 23:38:05,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 779.16 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 154.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:38:05,057 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.91 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:38:05,057 INFO L168 Benchmark]: Boogie Preprocessor took 35.39 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:38:05,058 INFO L168 Benchmark]: RCFGBuilder took 795.81 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 102.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:38:05,058 INFO L168 Benchmark]: TraceAbstraction took 176337.68 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 102.9 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-26 23:38:05,061 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.44 ms. Allocated memory is still 144.2 MB. Free memory is still 120.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 779.16 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.0 MB in the beginning and 154.8 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 83.91 ms. Allocated memory is still 201.3 MB. Free memory was 154.8 MB in the beginning and 151.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.39 ms. Allocated memory is still 201.3 MB. Free memory was 151.9 MB in the beginning and 149.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 795.81 ms. Allocated memory is still 201.3 MB. Free memory was 149.9 MB in the beginning and 102.9 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 176337.68 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 102.9 MB in the beginning and 2.9 GB in the end (delta: -2.8 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.9s, 163 ProgramPointsBefore, 83 ProgramPointsAfterwards, 194 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 32 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 26 ChoiceCompositions, 6760 VarBasedMoverChecksPositive, 302 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 261 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 66367 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t1903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] FCALL, FORK 0 pthread_create(&t1904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] FCALL, FORK 0 pthread_create(&t1905, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L730] 1 y = 2 [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L742] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 154 locations, 2 error locations. Result: UNSAFE, OverallTime: 175.9s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 49.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4449 SDtfs, 5631 SDslu, 11590 SDs, 0 SdLazy, 5639 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 37 SyntacticMatches, 15 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 516 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169732occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 105.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 197126 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 927 NumberOfCodeBlocks, 927 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 842 ConstructedInterpolants, 0 QuantifiedInterpolants, 112039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...