/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe033_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:50:03,740 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:50:03,743 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:50:03,763 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:50:03,763 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:50:03,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:50:03,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:50:03,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:50:03,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:50:03,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:50:03,779 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:50:03,780 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:50:03,780 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:50:03,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:50:03,782 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:50:03,783 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:50:03,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:50:03,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:50:03,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:50:03,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:50:03,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:50:03,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:50:03,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:50:03,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:50:03,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:50:03,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:50:03,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:50:03,798 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:50:03,799 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:50:03,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:50:03,802 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:50:03,803 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:50:03,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:50:03,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:50:03,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:50:03,808 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:50:03,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:50:03,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:50:03,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:50:03,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:50:03,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:50:03,815 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:50:03,831 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:50:03,831 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:50:03,832 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:50:03,832 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:50:03,833 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:50:03,833 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:50:03,833 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:50:03,833 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:50:03,834 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:50:03,834 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:50:03,834 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:50:03,834 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:50:03,834 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:50:03,835 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:50:03,835 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:50:03,835 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:50:03,835 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:50:03,835 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:50:03,836 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:50:03,836 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:50:03,836 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:50:03,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:50:03,837 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:50:03,837 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:50:03,837 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:50:03,837 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:50:03,837 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:50:03,838 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:50:03,838 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:50:03,838 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:50:03,838 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:50:04,145 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:50:04,159 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:50:04,163 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:50:04,165 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:50:04,165 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:50:04,166 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe033_rmo.opt.i [2019-12-27 18:50:04,244 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4e66d4a/54ec705f39784efcbcb52970fd0fcbcd/FLAGb01aea14d [2019-12-27 18:50:04,774 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:50:04,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe033_rmo.opt.i [2019-12-27 18:50:04,797 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4e66d4a/54ec705f39784efcbcb52970fd0fcbcd/FLAGb01aea14d [2019-12-27 18:50:05,053 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a4e66d4a/54ec705f39784efcbcb52970fd0fcbcd [2019-12-27 18:50:05,063 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:50:05,064 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:50:05,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:50:05,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:50:05,068 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:50:05,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d0f568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05, skipping insertion in model container [2019-12-27 18:50:05,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:50:05,130 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:50:05,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:50:05,684 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:50:05,772 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:50:05,842 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:50:05,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05 WrapperNode [2019-12-27 18:50:05,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:50:05,844 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:50:05,844 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:50:05,844 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:50:05,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,875 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:50:05,916 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:50:05,916 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:50:05,916 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:50:05,926 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... [2019-12-27 18:50:05,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:50:05,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:50:05,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:50:05,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:50:05,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:50:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:50:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:50:06,022 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:50:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:50:06,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:50:06,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:50:06,024 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:50:06,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:50:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:50:06,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:50:06,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:50:06,028 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:50:06,713 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:50:06,715 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:50:06,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:50:06 BoogieIcfgContainer [2019-12-27 18:50:06,716 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:50:06,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:50:06,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:50:06,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:50:06,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:50:05" (1/3) ... [2019-12-27 18:50:06,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ead33e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:50:06, skipping insertion in model container [2019-12-27 18:50:06,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:50:05" (2/3) ... [2019-12-27 18:50:06,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ead33e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:50:06, skipping insertion in model container [2019-12-27 18:50:06,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:50:06" (3/3) ... [2019-12-27 18:50:06,728 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_rmo.opt.i [2019-12-27 18:50:06,740 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:50:06,740 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:50:06,755 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:50:06,756 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:50:06,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,815 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,816 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,816 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,817 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,818 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,819 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,820 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,821 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,824 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,826 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,827 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,828 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,829 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,830 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,831 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,832 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,833 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,834 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,835 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,838 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,839 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,839 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,839 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,839 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,840 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,840 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,847 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,851 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,852 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,853 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,857 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,858 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,858 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,859 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,860 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:50:06,878 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 18:50:06,915 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:50:06,915 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:50:06,915 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:50:06,915 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:50:06,916 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:50:06,916 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:50:06,916 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:50:06,916 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:50:06,933 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-27 18:50:06,935 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 18:50:07,028 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 18:50:07,028 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:50:07,048 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 18:50:07,066 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-27 18:50:07,123 INFO L132 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-27 18:50:07,123 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:50:07,128 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 343 event pairs. 0/123 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 18:50:07,141 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 18:50:07,142 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:50:11,831 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 18:50:11,963 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 18:50:12,075 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-27 18:50:12,075 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 18:50:12,079 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-27 18:50:12,461 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-27 18:50:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-27 18:50:12,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:50:12,472 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:12,473 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:50:12,474 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:12,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:12,481 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-27 18:50:12,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:12,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429386762] [2019-12-27 18:50:12,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:12,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:12,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:12,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429386762] [2019-12-27 18:50:12,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:12,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:50:12,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2087175630] [2019-12-27 18:50:12,785 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:12,791 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:12,805 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:50:12,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:12,810 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:50:12,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:50:12,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:50:12,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:50:12,825 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-27 18:50:13,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:13,070 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-27 18:50:13,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:50:13,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:50:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:13,148 INFO L225 Difference]: With dead ends: 6240 [2019-12-27 18:50:13,148 INFO L226 Difference]: Without dead ends: 5850 [2019-12-27 18:50:13,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:50:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-27 18:50:13,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-27 18:50:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-27 18:50:13,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-27 18:50:13,589 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-27 18:50:13,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:13,592 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-27 18:50:13,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:50:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-27 18:50:13,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:50:13,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:13,606 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:50:13,606 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:13,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:13,607 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-27 18:50:13,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:13,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336081844] [2019-12-27 18:50:13,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:13,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:13,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336081844] [2019-12-27 18:50:13,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:13,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:50:13,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1820244714] [2019-12-27 18:50:13,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:13,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:13,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 18:50:13,713 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:13,713 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:50:13,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:50:13,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:13,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:50:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:50:13,715 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 3 states. [2019-12-27 18:50:13,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:13,744 INFO L93 Difference]: Finished difference Result 1185 states and 2948 transitions. [2019-12-27 18:50:13,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:50:13,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 18:50:13,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:13,752 INFO L225 Difference]: With dead ends: 1185 [2019-12-27 18:50:13,752 INFO L226 Difference]: Without dead ends: 1185 [2019-12-27 18:50:13,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:50:13,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2019-12-27 18:50:13,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 1185. [2019-12-27 18:50:13,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-12-27 18:50:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 2948 transitions. [2019-12-27 18:50:13,787 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 2948 transitions. Word has length 11 [2019-12-27 18:50:13,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:13,787 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 2948 transitions. [2019-12-27 18:50:13,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:50:13,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 2948 transitions. [2019-12-27 18:50:13,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:50:13,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:13,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:50:13,789 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:13,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:13,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-27 18:50:13,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:13,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617999407] [2019-12-27 18:50:13,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:13,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:13,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617999407] [2019-12-27 18:50:13,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:13,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:50:13,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2146969551] [2019-12-27 18:50:13,887 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:13,890 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:13,901 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:50:13,901 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:13,956 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:50:13,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:50:13,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:50:13,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:50:13,957 INFO L87 Difference]: Start difference. First operand 1185 states and 2948 transitions. Second operand 5 states. [2019-12-27 18:50:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:14,077 INFO L93 Difference]: Finished difference Result 1756 states and 4318 transitions. [2019-12-27 18:50:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:50:14,077 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:50:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:14,087 INFO L225 Difference]: With dead ends: 1756 [2019-12-27 18:50:14,088 INFO L226 Difference]: Without dead ends: 1756 [2019-12-27 18:50:14,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:50:14,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1756 states. [2019-12-27 18:50:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1756 to 1300. [2019-12-27 18:50:14,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2019-12-27 18:50:14,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 3182 transitions. [2019-12-27 18:50:14,141 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 3182 transitions. Word has length 14 [2019-12-27 18:50:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:14,141 INFO L462 AbstractCegarLoop]: Abstraction has 1300 states and 3182 transitions. [2019-12-27 18:50:14,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:50:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 3182 transitions. [2019-12-27 18:50:14,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:50:14,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:14,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:50:14,146 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:14,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-27 18:50:14,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:14,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737416437] [2019-12-27 18:50:14,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:14,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:14,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737416437] [2019-12-27 18:50:14,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:14,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:50:14,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [142083406] [2019-12-27 18:50:14,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:14,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:14,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:50:14,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:14,283 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:50:14,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:50:14,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:50:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:50:14,285 INFO L87 Difference]: Start difference. First operand 1300 states and 3182 transitions. Second operand 5 states. [2019-12-27 18:50:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:14,474 INFO L93 Difference]: Finished difference Result 1703 states and 4071 transitions. [2019-12-27 18:50:14,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:50:14,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:50:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:14,484 INFO L225 Difference]: With dead ends: 1703 [2019-12-27 18:50:14,484 INFO L226 Difference]: Without dead ends: 1703 [2019-12-27 18:50:14,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:50:14,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-12-27 18:50:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1513. [2019-12-27 18:50:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1513 states. [2019-12-27 18:50:14,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 3661 transitions. [2019-12-27 18:50:14,530 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 3661 transitions. Word has length 14 [2019-12-27 18:50:14,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:14,533 INFO L462 AbstractCegarLoop]: Abstraction has 1513 states and 3661 transitions. [2019-12-27 18:50:14,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:50:14,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 3661 transitions. [2019-12-27 18:50:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:50:14,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:14,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:50:14,537 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:14,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-27 18:50:14,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:14,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134089822] [2019-12-27 18:50:14,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:14,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:14,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134089822] [2019-12-27 18:50:14,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:14,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:50:14,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2103121397] [2019-12-27 18:50:14,616 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:14,618 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:14,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:50:14,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:14,645 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:50:14,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:50:14,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:14,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:50:14,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:50:14,646 INFO L87 Difference]: Start difference. First operand 1513 states and 3661 transitions. Second operand 5 states. [2019-12-27 18:50:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:14,900 INFO L93 Difference]: Finished difference Result 1972 states and 4699 transitions. [2019-12-27 18:50:14,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:50:14,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:50:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:14,912 INFO L225 Difference]: With dead ends: 1972 [2019-12-27 18:50:14,912 INFO L226 Difference]: Without dead ends: 1972 [2019-12-27 18:50:14,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:50:14,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2019-12-27 18:50:14,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1607. [2019-12-27 18:50:14,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-27 18:50:14,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-27 18:50:14,954 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 14 [2019-12-27 18:50:14,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:14,955 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-27 18:50:14,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:50:14,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-27 18:50:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 18:50:14,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:14,958 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] [2019-12-27 18:50:14,958 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:14,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:14,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-27 18:50:14,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:14,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744488826] [2019-12-27 18:50:14,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:15,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:15,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744488826] [2019-12-27 18:50:15,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:15,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:50:15,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1292521467] [2019-12-27 18:50:15,007 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:15,011 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:15,022 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 18:50:15,022 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:15,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:50:15,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:50:15,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:15,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:50:15,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:50:15,037 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-12-27 18:50:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:15,059 INFO L93 Difference]: Finished difference Result 772 states and 1728 transitions. [2019-12-27 18:50:15,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:50:15,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 18:50:15,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:15,064 INFO L225 Difference]: With dead ends: 772 [2019-12-27 18:50:15,064 INFO L226 Difference]: Without dead ends: 772 [2019-12-27 18:50:15,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:50:15,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-12-27 18:50:15,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 722. [2019-12-27 18:50:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-12-27 18:50:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 1628 transitions. [2019-12-27 18:50:15,080 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 1628 transitions. Word has length 26 [2019-12-27 18:50:15,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:15,081 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 1628 transitions. [2019-12-27 18:50:15,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:50:15,081 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 1628 transitions. [2019-12-27 18:50:15,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:50:15,083 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:15,083 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-27 18:50:15,084 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:15,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:15,084 INFO L82 PathProgramCache]: Analyzing trace with hash -635782706, now seen corresponding path program 1 times [2019-12-27 18:50:15,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:15,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754692709] [2019-12-27 18:50:15,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:15,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754692709] [2019-12-27 18:50:15,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:15,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:50:15,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2076403978] [2019-12-27 18:50:15,169 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:15,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:15,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 132 transitions. [2019-12-27 18:50:15,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:15,221 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:50:15,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:50:15,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:15,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:50:15,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:50:15,223 INFO L87 Difference]: Start difference. First operand 722 states and 1628 transitions. Second operand 4 states. [2019-12-27 18:50:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:15,241 INFO L93 Difference]: Finished difference Result 1140 states and 2599 transitions. [2019-12-27 18:50:15,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:50:15,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 18:50:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:15,245 INFO L225 Difference]: With dead ends: 1140 [2019-12-27 18:50:15,245 INFO L226 Difference]: Without dead ends: 438 [2019-12-27 18:50:15,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:50:15,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-12-27 18:50:15,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2019-12-27 18:50:15,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-12-27 18:50:15,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 1004 transitions. [2019-12-27 18:50:15,255 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 1004 transitions. Word has length 41 [2019-12-27 18:50:15,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:15,255 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 1004 transitions. [2019-12-27 18:50:15,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:50:15,256 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 1004 transitions. [2019-12-27 18:50:15,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:50:15,257 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:15,258 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-27 18:50:15,258 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash 822694706, now seen corresponding path program 2 times [2019-12-27 18:50:15,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:15,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048876999] [2019-12-27 18:50:15,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:15,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-27 18:50:15,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048876999] [2019-12-27 18:50:15,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:15,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:50:15,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [967891476] [2019-12-27 18:50:15,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:15,347 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:15,382 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 118 transitions. [2019-12-27 18:50:15,382 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:15,583 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:50:15,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:50:15,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:15,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:50:15,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:50:15,627 INFO L87 Difference]: Start difference. First operand 438 states and 1004 transitions. Second operand 9 states. [2019-12-27 18:50:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:16,980 INFO L93 Difference]: Finished difference Result 1860 states and 4176 transitions. [2019-12-27 18:50:16,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 18:50:16,980 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 18:50:16,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:16,989 INFO L225 Difference]: With dead ends: 1860 [2019-12-27 18:50:16,989 INFO L226 Difference]: Without dead ends: 1201 [2019-12-27 18:50:16,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=376, Unknown=0, NotChecked=0, Total=506 [2019-12-27 18:50:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2019-12-27 18:50:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 615. [2019-12-27 18:50:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-12-27 18:50:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1393 transitions. [2019-12-27 18:50:17,008 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1393 transitions. Word has length 41 [2019-12-27 18:50:17,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:17,010 INFO L462 AbstractCegarLoop]: Abstraction has 615 states and 1393 transitions. [2019-12-27 18:50:17,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:50:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1393 transitions. [2019-12-27 18:50:17,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:50:17,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:17,012 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-27 18:50:17,012 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:17,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:17,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1004168232, now seen corresponding path program 3 times [2019-12-27 18:50:17,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:17,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426992088] [2019-12-27 18:50:17,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:17,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:17,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426992088] [2019-12-27 18:50:17,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:17,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:50:17,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [58508577] [2019-12-27 18:50:17,169 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:17,183 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:17,286 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 127 transitions. [2019-12-27 18:50:17,287 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:17,578 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 18:50:17,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 18:50:17,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:17,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 18:50:17,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:50:17,580 INFO L87 Difference]: Start difference. First operand 615 states and 1393 transitions. Second operand 16 states. [2019-12-27 18:50:20,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:20,019 INFO L93 Difference]: Finished difference Result 1357 states and 2753 transitions. [2019-12-27 18:50:20,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 18:50:20,020 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2019-12-27 18:50:20,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:20,036 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 18:50:20,037 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 18:50:20,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=367, Invalid=1193, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 18:50:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 18:50:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 770. [2019-12-27 18:50:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-12-27 18:50:20,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1647 transitions. [2019-12-27 18:50:20,078 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1647 transitions. Word has length 41 [2019-12-27 18:50:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:20,078 INFO L462 AbstractCegarLoop]: Abstraction has 770 states and 1647 transitions. [2019-12-27 18:50:20,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 18:50:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1647 transitions. [2019-12-27 18:50:20,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:50:20,080 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:20,080 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-27 18:50:20,081 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:20,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:20,081 INFO L82 PathProgramCache]: Analyzing trace with hash 910051156, now seen corresponding path program 4 times [2019-12-27 18:50:20,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:20,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801163035] [2019-12-27 18:50:20,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:20,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801163035] [2019-12-27 18:50:20,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:20,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:50:20,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [135665811] [2019-12-27 18:50:20,203 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:20,215 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:20,242 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 98 transitions. [2019-12-27 18:50:20,242 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:20,293 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:50:20,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:50:20,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:20,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:50:20,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:50:20,295 INFO L87 Difference]: Start difference. First operand 770 states and 1647 transitions. Second operand 11 states. [2019-12-27 18:50:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:22,104 INFO L93 Difference]: Finished difference Result 2176 states and 4399 transitions. [2019-12-27 18:50:22,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-12-27 18:50:22,104 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 41 [2019-12-27 18:50:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:22,113 INFO L225 Difference]: With dead ends: 2176 [2019-12-27 18:50:22,113 INFO L226 Difference]: Without dead ends: 1328 [2019-12-27 18:50:22,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 753 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=590, Invalid=1860, Unknown=0, NotChecked=0, Total=2450 [2019-12-27 18:50:22,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2019-12-27 18:50:22,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 736. [2019-12-27 18:50:22,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2019-12-27 18:50:22,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1537 transitions. [2019-12-27 18:50:22,136 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1537 transitions. Word has length 41 [2019-12-27 18:50:22,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:22,137 INFO L462 AbstractCegarLoop]: Abstraction has 736 states and 1537 transitions. [2019-12-27 18:50:22,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:50:22,137 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1537 transitions. [2019-12-27 18:50:22,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:50:22,139 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:22,139 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-27 18:50:22,139 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:22,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:22,139 INFO L82 PathProgramCache]: Analyzing trace with hash -20717114, now seen corresponding path program 5 times [2019-12-27 18:50:22,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:22,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674361390] [2019-12-27 18:50:22,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:22,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:22,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674361390] [2019-12-27 18:50:22,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:22,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:50:22,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [224133549] [2019-12-27 18:50:22,226 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:22,236 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:22,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 64 states and 83 transitions. [2019-12-27 18:50:22,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:22,303 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:50:22,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:50:22,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:22,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:50:22,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:50:22,304 INFO L87 Difference]: Start difference. First operand 736 states and 1537 transitions. Second operand 7 states. [2019-12-27 18:50:22,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:22,929 INFO L93 Difference]: Finished difference Result 1040 states and 2121 transitions. [2019-12-27 18:50:22,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 18:50:22,929 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 18:50:22,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:22,934 INFO L225 Difference]: With dead ends: 1040 [2019-12-27 18:50:22,935 INFO L226 Difference]: Without dead ends: 1040 [2019-12-27 18:50:22,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:50:22,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2019-12-27 18:50:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 769. [2019-12-27 18:50:22,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-27 18:50:22,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1609 transitions. [2019-12-27 18:50:22,952 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1609 transitions. Word has length 41 [2019-12-27 18:50:22,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:22,953 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1609 transitions. [2019-12-27 18:50:22,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:50:22,953 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1609 transitions. [2019-12-27 18:50:22,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 18:50:22,955 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:22,955 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-27 18:50:22,955 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:22,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:22,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1415185578, now seen corresponding path program 6 times [2019-12-27 18:50:22,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:22,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413750693] [2019-12-27 18:50:22,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:22,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:50:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:50:23,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413750693] [2019-12-27 18:50:23,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:50:23,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:50:23,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [109677694] [2019-12-27 18:50:23,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:50:23,029 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:50:23,057 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 97 transitions. [2019-12-27 18:50:23,057 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:50:23,058 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:50:23,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:50:23,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:50:23,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:50:23,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:50:23,059 INFO L87 Difference]: Start difference. First operand 769 states and 1609 transitions. Second operand 3 states. [2019-12-27 18:50:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:50:23,074 INFO L93 Difference]: Finished difference Result 769 states and 1607 transitions. [2019-12-27 18:50:23,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:50:23,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 18:50:23,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:50:23,077 INFO L225 Difference]: With dead ends: 769 [2019-12-27 18:50:23,077 INFO L226 Difference]: Without dead ends: 769 [2019-12-27 18:50:23,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:50:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2019-12-27 18:50:23,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 635. [2019-12-27 18:50:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-12-27 18:50:23,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1349 transitions. [2019-12-27 18:50:23,091 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1349 transitions. Word has length 41 [2019-12-27 18:50:23,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:50:23,092 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 1349 transitions. [2019-12-27 18:50:23,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:50:23,092 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1349 transitions. [2019-12-27 18:50:23,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 18:50:23,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:50:23,094 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-27 18:50:23,094 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:50:23,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:50:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 1 times [2019-12-27 18:50:23,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:50:23,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070376353] [2019-12-27 18:50:23,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:50:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:50:23,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:50:23,191 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:50:23,192 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:50:23,196 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2571~0.base_24| 4) |v_#length_15|) (= 0 v_~x$r_buff0_thd2~0_163) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) (= v_~x$r_buff0_thd0~0_130 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24|) 0) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2571~0.base_24| 1)) (= v_~y~0_90 0) (= 0 v_~x$read_delayed_var~0.base_7) (= 0 v_~x$w_buff0~0_579) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2571~0.base_24|) |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~x$r_buff1_thd2~0_124) (= |v_ULTIMATE.start_main_~#t2571~0.offset_18| 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_18|, ~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_~#t2571~0.base=|v_ULTIMATE.start_main_~#t2571~0.base_24|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, #length=|v_#length_15|, ~y~0=v_~y~0_90, ULTIMATE.start_main_~#t2571~0.offset=|v_ULTIMATE.start_main_~#t2571~0.offset_18|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_25|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_~#t2571~0.base, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, #length, ~y~0, ULTIMATE.start_main_~#t2571~0.offset, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2572~0.base, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:50:23,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2572~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t2572~0.offset_9| 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2572~0.base_11|) |v_ULTIMATE.start_main_~#t2572~0.offset_9| 1))) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2572~0.base_11| 4)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2572~0.base_11|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2572~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t2572~0.offset=|v_ULTIMATE.start_main_~#t2572~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2572~0.base=|v_ULTIMATE.start_main_~#t2572~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2572~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2572~0.base] because there is no mapped edge [2019-12-27 18:50:23,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22 0)) (= 1 v_~x$r_buff0_thd2~0_15) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_22, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:50:23,201 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-256770833 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite8_Out-256770833| ~x$w_buff0~0_In-256770833) .cse0 (= |P0Thread1of1ForFork1_#t~ite8_Out-256770833| |P0Thread1of1ForFork1_#t~ite9_Out-256770833|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-256770833 256) 0))) (or (and .cse1 (= 0 (mod ~x$w_buff1_used~0_In-256770833 256))) (= 0 (mod ~x$w_buff0_used~0_In-256770833 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-256770833 256)) .cse1)))) (and (= |P0Thread1of1ForFork1_#t~ite9_Out-256770833| ~x$w_buff0~0_In-256770833) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In-256770833| |P0Thread1of1ForFork1_#t~ite8_Out-256770833|)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-256770833, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-256770833, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-256770833|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-256770833, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-256770833, ~weak$$choice2~0=~weak$$choice2~0_In-256770833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-256770833} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-256770833, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-256770833, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-256770833|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-256770833|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-256770833, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-256770833, ~weak$$choice2~0=~weak$$choice2~0_In-256770833, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-256770833} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-27 18:50:23,207 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_16|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-27 18:50:23,208 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_21|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:50:23,209 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1156480279 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1156480279 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1156480279|) (not .cse1)) (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1156480279| ~x$w_buff0_used~0_In-1156480279) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1156480279, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1156480279} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1156480279, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1156480279|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1156480279} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:50:23,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1345748055 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1345748055 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In1345748055 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1345748055 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite29_Out1345748055| ~x$w_buff1_used~0_In1345748055) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1345748055|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1345748055, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1345748055, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1345748055, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1345748055} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1345748055, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1345748055, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1345748055, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1345748055|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1345748055} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:50:23,210 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1588800782 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1588800782 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd2~0_In1588800782 ~x$r_buff0_thd2~0_Out1588800782)) (and (= 0 ~x$r_buff0_thd2~0_Out1588800782) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1588800782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1588800782} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1588800782|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1588800782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1588800782} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:50:23,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In246831736 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In246831736 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In246831736 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In246831736 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out246831736| ~x$r_buff1_thd2~0_In246831736) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out246831736| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In246831736, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In246831736, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In246831736, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246831736} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out246831736|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In246831736, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In246831736, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In246831736, ~x$w_buff0_used~0=~x$w_buff0_used~0_In246831736} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:50:23,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_36|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_35|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, 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-27 18:50:23,211 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:50:23,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In962018287 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In962018287 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out962018287| |ULTIMATE.start_main_#t~ite34_Out962018287|))) (or (and (= ~x~0_In962018287 |ULTIMATE.start_main_#t~ite34_Out962018287|) (or .cse0 .cse1) .cse2) (and (= ~x$w_buff1~0_In962018287 |ULTIMATE.start_main_#t~ite34_Out962018287|) (not .cse1) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In962018287, ~x$w_buff1_used~0=~x$w_buff1_used~0_In962018287, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In962018287, ~x~0=~x~0_In962018287} OutVars{~x$w_buff1~0=~x$w_buff1~0_In962018287, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out962018287|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In962018287, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In962018287, ~x~0=~x~0_In962018287, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out962018287|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 18:50:23,212 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-230523834 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-230523834 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-230523834 |ULTIMATE.start_main_#t~ite36_Out-230523834|)) (and (= 0 |ULTIMATE.start_main_#t~ite36_Out-230523834|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-230523834, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-230523834} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-230523834, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-230523834|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-230523834} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 18:50:23,213 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-2073726528 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-2073726528 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-2073726528 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2073726528 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite37_Out-2073726528|)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out-2073726528| ~x$w_buff1_used~0_In-2073726528)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2073726528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2073726528, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2073726528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2073726528} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-2073726528, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2073726528, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-2073726528|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2073726528, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2073726528} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 18:50:23,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In72625637 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In72625637 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite38_Out72625637| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out72625637| ~x$r_buff0_thd0~0_In72625637)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In72625637, ~x$w_buff0_used~0=~x$w_buff0_used~0_In72625637} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In72625637, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out72625637|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In72625637} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 18:50:23,214 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1181698461 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In1181698461 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1181698461 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In1181698461 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In1181698461 |ULTIMATE.start_main_#t~ite39_Out1181698461|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite39_Out1181698461| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1181698461, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1181698461, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1181698461, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1181698461} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1181698461, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1181698461|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1181698461, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1181698461, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1181698461} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 18:50:23,215 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~y~0_54 2) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|) (= 0 v_~__unbuffered_p0_EAX~0_44) (= v_~main$tmp_guard1~0_22 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:50:23,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:50:23 BasicIcfg [2019-12-27 18:50:23,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:50:23,296 INFO L168 Benchmark]: Toolchain (without parser) took 18231.88 ms. Allocated memory was 140.5 MB in the beginning and 501.7 MB in the end (delta: 361.2 MB). Free memory was 103.0 MB in the beginning and 92.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 371.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:50:23,297 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 140.5 MB. Free memory is still 122.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 18:50:23,297 INFO L168 Benchmark]: CACSL2BoogieTranslator took 778.19 ms. Allocated memory was 140.5 MB in the beginning and 205.0 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 160.6 MB in the end (delta: -58.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:50:23,298 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.74 ms. Allocated memory is still 205.0 MB. Free memory was 160.6 MB in the beginning and 157.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:50:23,301 INFO L168 Benchmark]: Boogie Preprocessor took 35.65 ms. Allocated memory is still 205.0 MB. Free memory was 157.8 MB in the beginning and 155.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:50:23,301 INFO L168 Benchmark]: RCFGBuilder took 764.89 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 114.7 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-12-27 18:50:23,304 INFO L168 Benchmark]: TraceAbstraction took 16576.09 ms. Allocated memory was 205.0 MB in the beginning and 501.7 MB in the end (delta: 296.7 MB). Free memory was 114.7 MB in the beginning and 92.3 MB in the end (delta: 22.4 MB). Peak memory consumption was 319.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:50:23,315 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.13 ms. Allocated memory is still 140.5 MB. Free memory is still 122.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 778.19 ms. Allocated memory was 140.5 MB in the beginning and 205.0 MB in the end (delta: 64.5 MB). Free memory was 102.6 MB in the beginning and 160.6 MB in the end (delta: -58.0 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.74 ms. Allocated memory is still 205.0 MB. Free memory was 160.6 MB in the beginning and 157.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.65 ms. Allocated memory is still 205.0 MB. Free memory was 157.8 MB in the beginning and 155.9 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 764.89 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 114.7 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16576.09 ms. Allocated memory was 205.0 MB in the beginning and 501.7 MB in the end (delta: 296.7 MB). Free memory was 114.7 MB in the beginning and 92.3 MB in the end (delta: 22.4 MB). Peak memory consumption was 319.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.1s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2571, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2572, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 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) [L767] 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 [!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)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 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)) [L734] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 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)) [L735] 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=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 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)) [L736] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 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)) [L738] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, 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))=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 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)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 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) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 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 [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 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 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.2s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1390 SDtfs, 2534 SDslu, 3384 SDs, 0 SdLazy, 3294 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 180 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6362occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 3231 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 318 ConstructedInterpolants, 0 QuantifiedInterpolants, 36408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...