/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/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:46:49,829 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:46:49,832 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:46:49,847 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:46:49,847 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:46:49,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:46:49,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:46:49,861 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:46:49,864 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:46:49,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:46:49,870 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:46:49,872 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:46:49,872 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:46:49,874 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:46:49,876 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:46:49,878 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:46:49,879 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:46:49,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:46:49,881 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:46:49,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:46:49,890 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:46:49,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:46:49,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:46:49,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:46:49,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:46:49,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:46:49,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:46:49,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:46:49,901 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:46:49,902 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:46:49,902 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:46:49,904 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:46:49,905 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:46:49,906 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:46:49,907 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:46:49,907 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:46:49,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:46:49,908 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:46:49,908 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:46:49,909 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:46:49,911 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:46:49,911 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:46:49,944 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:46:49,945 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:46:49,946 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:46:49,946 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:46:49,946 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:46:49,947 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:46:49,950 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:46:49,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:46:49,950 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:46:49,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:46:49,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:46:49,951 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:46:49,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:46:49,951 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:46:49,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:46:49,952 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:46:49,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:46:49,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:46:49,955 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:46:49,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:46:49,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:46:49,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:46:49,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:46:49,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:46:49,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:46:49,956 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:46:49,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:46:49,956 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:46:49,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:46:49,959 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:46:49,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:46:50,229 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:46:50,244 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:46:50,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:46:50,250 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:46:50,251 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:46:50,251 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2019-12-27 18:46:50,324 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f168c267/4538146fa81845c4a439db65023702d6/FLAGaeeae13c4 [2019-12-27 18:46:50,865 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:46:50,865 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2019-12-27 18:46:50,878 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f168c267/4538146fa81845c4a439db65023702d6/FLAGaeeae13c4 [2019-12-27 18:46:51,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f168c267/4538146fa81845c4a439db65023702d6 [2019-12-27 18:46:51,144 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:46:51,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:46:51,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:51,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:46:51,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:46:51,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:51,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23abe169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51, skipping insertion in model container [2019-12-27 18:46:51,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:51,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:46:51,229 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:46:51,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:51,760 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:46:51,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:46:51,918 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:46:51,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51 WrapperNode [2019-12-27 18:46:51,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:46:51,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:51,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:46:51,920 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:46:51,929 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:46:51" (1/1) ... [2019-12-27 18:46:51,954 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:46:51" (1/1) ... [2019-12-27 18:46:51,993 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:46:51,994 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:46:51,994 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:46:51,994 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:46:52,004 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:52,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:52,010 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:52,010 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:52,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:52,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:52,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (1/1) ... [2019-12-27 18:46:52,039 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:46:52,046 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:46:52,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:46:52,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:46:52,047 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (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:46:52,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:46:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:46:52,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:46:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:46:52,108 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:46:52,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:46:52,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:46:52,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:46:52,110 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:46:52,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:46:52,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:46:52,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:46:52,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:46:52,112 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:46:52,872 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:46:52,874 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:46:52,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:52 BoogieIcfgContainer [2019-12-27 18:46:52,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:46:52,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:46:52,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:46:52,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:46:52,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:46:51" (1/3) ... [2019-12-27 18:46:52,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785baf43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:52, skipping insertion in model container [2019-12-27 18:46:52,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:46:51" (2/3) ... [2019-12-27 18:46:52,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@785baf43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:46:52, skipping insertion in model container [2019-12-27 18:46:52,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:46:52" (3/3) ... [2019-12-27 18:46:52,889 INFO L109 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2019-12-27 18:46:52,901 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:46:52,901 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:46:52,915 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:46:52,916 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:46:52,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,956 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,959 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,973 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,974 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,975 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,975 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,976 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,976 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,976 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,977 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,988 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,988 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,989 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,990 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,990 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,991 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,991 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,997 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:52,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:46:53,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:46:53,041 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:46:53,058 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:46:53,058 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:46:53,058 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:46:53,059 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:46:53,059 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:46:53,059 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:46:53,059 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:46:53,077 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 192 transitions [2019-12-27 18:46:53,079 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 18:46:53,183 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 18:46:53,183 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:53,196 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:46:53,213 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 161 places, 192 transitions [2019-12-27 18:46:53,292 INFO L132 PetriNetUnfolder]: 41/189 cut-off events. [2019-12-27 18:46:53,292 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:46:53,301 INFO L76 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 41/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 259 event pairs. 0/146 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:46:53,317 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-27 18:46:53,318 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:46:58,211 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 18:46:58,342 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 18:46:58,366 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46210 [2019-12-27 18:46:58,366 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 18:46:58,370 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 86 transitions [2019-12-27 18:46:59,245 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 15658 states. [2019-12-27 18:46:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 15658 states. [2019-12-27 18:46:59,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 18:46:59,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:46:59,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:46:59,254 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:46:59,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:46:59,260 INFO L82 PathProgramCache]: Analyzing trace with hash 430910871, now seen corresponding path program 1 times [2019-12-27 18:46:59,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:46:59,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691439952] [2019-12-27 18:46:59,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:46:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:46:59,511 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:46:59,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691439952] [2019-12-27 18:46:59,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:46:59,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:46:59,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1142357575] [2019-12-27 18:46:59,514 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:46:59,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:46:59,533 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 18:46:59,534 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:46:59,537 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:46:59,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:46:59,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:46:59,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:46:59,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:46:59,551 INFO L87 Difference]: Start difference. First operand 15658 states. Second operand 3 states. [2019-12-27 18:46:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:46:59,922 INFO L93 Difference]: Finished difference Result 15586 states and 57554 transitions. [2019-12-27 18:46:59,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:46:59,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 18:46:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:00,117 INFO L225 Difference]: With dead ends: 15586 [2019-12-27 18:47:00,118 INFO L226 Difference]: Without dead ends: 15248 [2019-12-27 18:47:00,119 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:47:00,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15248 states. [2019-12-27 18:47:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15248 to 15248. [2019-12-27 18:47:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15248 states. [2019-12-27 18:47:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15248 states to 15248 states and 56345 transitions. [2019-12-27 18:47:01,352 INFO L78 Accepts]: Start accepts. Automaton has 15248 states and 56345 transitions. Word has length 7 [2019-12-27 18:47:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:01,353 INFO L462 AbstractCegarLoop]: Abstraction has 15248 states and 56345 transitions. [2019-12-27 18:47:01,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:01,354 INFO L276 IsEmpty]: Start isEmpty. Operand 15248 states and 56345 transitions. [2019-12-27 18:47:01,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:47:01,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:01,359 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:01,359 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:01,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:01,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1550259791, now seen corresponding path program 1 times [2019-12-27 18:47:01,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:01,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918560002] [2019-12-27 18:47:01,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:01,499 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:47:01,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918560002] [2019-12-27 18:47:01,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:01,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:01,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774828708] [2019-12-27 18:47:01,500 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:01,502 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:01,509 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 37 transitions. [2019-12-27 18:47:01,509 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:01,559 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:47:01,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:47:01,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:47:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:47:01,562 INFO L87 Difference]: Start difference. First operand 15248 states and 56345 transitions. Second operand 5 states. [2019-12-27 18:47:02,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:02,328 INFO L93 Difference]: Finished difference Result 24364 states and 86703 transitions. [2019-12-27 18:47:02,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:47:02,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-12-27 18:47:02,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:02,431 INFO L225 Difference]: With dead ends: 24364 [2019-12-27 18:47:02,431 INFO L226 Difference]: Without dead ends: 24350 [2019-12-27 18:47:02,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 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:47:02,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24350 states. [2019-12-27 18:47:03,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24350 to 21678. [2019-12-27 18:47:03,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21678 states. [2019-12-27 18:47:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21678 states to 21678 states and 78082 transitions. [2019-12-27 18:47:03,359 INFO L78 Accepts]: Start accepts. Automaton has 21678 states and 78082 transitions. Word has length 13 [2019-12-27 18:47:03,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:03,359 INFO L462 AbstractCegarLoop]: Abstraction has 21678 states and 78082 transitions. [2019-12-27 18:47:03,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:47:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 21678 states and 78082 transitions. [2019-12-27 18:47:03,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:47:03,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:03,363 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:03,365 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:03,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:03,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1785022215, now seen corresponding path program 1 times [2019-12-27 18:47:03,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:03,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135051356] [2019-12-27 18:47:03,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:03,461 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:47:03,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135051356] [2019-12-27 18:47:03,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:03,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:03,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1152044476] [2019-12-27 18:47:03,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:03,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:03,466 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:47:03,466 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:03,467 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:03,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:47:03,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:03,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:47:03,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:03,468 INFO L87 Difference]: Start difference. First operand 21678 states and 78082 transitions. Second operand 3 states. [2019-12-27 18:47:03,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:03,553 INFO L93 Difference]: Finished difference Result 12388 states and 38538 transitions. [2019-12-27 18:47:03,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:47:03,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:47:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:03,589 INFO L225 Difference]: With dead ends: 12388 [2019-12-27 18:47:03,589 INFO L226 Difference]: Without dead ends: 12388 [2019-12-27 18:47:03,590 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:47:03,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12388 states. [2019-12-27 18:47:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12388 to 12388. [2019-12-27 18:47:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12388 states. [2019-12-27 18:47:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12388 states to 12388 states and 38538 transitions. [2019-12-27 18:47:04,767 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 38538 transitions. Word has length 13 [2019-12-27 18:47:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:04,767 INFO L462 AbstractCegarLoop]: Abstraction has 12388 states and 38538 transitions. [2019-12-27 18:47:04,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 38538 transitions. [2019-12-27 18:47:04,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:47:04,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:04,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:04,770 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:04,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:04,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1922152669, now seen corresponding path program 1 times [2019-12-27 18:47:04,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:04,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110210920] [2019-12-27 18:47:04,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:04,857 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:47:04,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110210920] [2019-12-27 18:47:04,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:04,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:47:04,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [603858433] [2019-12-27 18:47:04,858 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:04,859 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:04,863 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 22 transitions. [2019-12-27 18:47:04,864 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:04,879 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:47:04,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:47:04,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:47:04,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:47:04,881 INFO L87 Difference]: Start difference. First operand 12388 states and 38538 transitions. Second operand 5 states. [2019-12-27 18:47:04,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:04,929 INFO L93 Difference]: Finished difference Result 1903 states and 4374 transitions. [2019-12-27 18:47:04,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:47:04,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 18:47:04,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:04,933 INFO L225 Difference]: With dead ends: 1903 [2019-12-27 18:47:04,933 INFO L226 Difference]: Without dead ends: 1903 [2019-12-27 18:47:04,934 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:47:04,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-27 18:47:04,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1903. [2019-12-27 18:47:04,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1903 states. [2019-12-27 18:47:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1903 states to 1903 states and 4374 transitions. [2019-12-27 18:47:04,972 INFO L78 Accepts]: Start accepts. Automaton has 1903 states and 4374 transitions. Word has length 14 [2019-12-27 18:47:04,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:04,972 INFO L462 AbstractCegarLoop]: Abstraction has 1903 states and 4374 transitions. [2019-12-27 18:47:04,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:47:04,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1903 states and 4374 transitions. [2019-12-27 18:47:04,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 18:47:04,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:04,975 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:47:04,975 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:04,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:04,976 INFO L82 PathProgramCache]: Analyzing trace with hash -560054606, now seen corresponding path program 1 times [2019-12-27 18:47:04,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:04,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477585165] [2019-12-27 18:47:04,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:05,057 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:47:05,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477585165] [2019-12-27 18:47:05,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:05,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:47:05,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [466273509] [2019-12-27 18:47:05,058 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:05,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:05,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 88 states and 170 transitions. [2019-12-27 18:47:05,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:05,139 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:47:05,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:47:05,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:05,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:47:05,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:47:05,140 INFO L87 Difference]: Start difference. First operand 1903 states and 4374 transitions. Second operand 7 states. [2019-12-27 18:47:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:05,182 INFO L93 Difference]: Finished difference Result 669 states and 1571 transitions. [2019-12-27 18:47:05,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:47:05,183 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-12-27 18:47:05,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:05,185 INFO L225 Difference]: With dead ends: 669 [2019-12-27 18:47:05,185 INFO L226 Difference]: Without dead ends: 669 [2019-12-27 18:47:05,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:47:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2019-12-27 18:47:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 599. [2019-12-27 18:47:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-27 18:47:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1406 transitions. [2019-12-27 18:47:05,198 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1406 transitions. Word has length 26 [2019-12-27 18:47:05,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:05,199 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1406 transitions. [2019-12-27 18:47:05,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:47:05,199 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1406 transitions. [2019-12-27 18:47:05,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:47:05,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:05,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:05,202 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:05,203 INFO L82 PathProgramCache]: Analyzing trace with hash 958609681, now seen corresponding path program 1 times [2019-12-27 18:47:05,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:05,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431824549] [2019-12-27 18:47:05,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:05,298 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:47:05,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431824549] [2019-12-27 18:47:05,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:05,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:47:05,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [765477903] [2019-12-27 18:47:05,299 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:05,323 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:05,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 203 transitions. [2019-12-27 18:47:05,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:05,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:05,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:47:05,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:05,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:47:05,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:05,422 INFO L87 Difference]: Start difference. First operand 599 states and 1406 transitions. Second operand 3 states. [2019-12-27 18:47:05,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:05,461 INFO L93 Difference]: Finished difference Result 610 states and 1420 transitions. [2019-12-27 18:47:05,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:47:05,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:47:05,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:05,464 INFO L225 Difference]: With dead ends: 610 [2019-12-27 18:47:05,465 INFO L226 Difference]: Without dead ends: 610 [2019-12-27 18:47:05,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:05,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-12-27 18:47:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 605. [2019-12-27 18:47:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 18:47:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1415 transitions. [2019-12-27 18:47:05,476 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1415 transitions. Word has length 54 [2019-12-27 18:47:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:05,476 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1415 transitions. [2019-12-27 18:47:05,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1415 transitions. [2019-12-27 18:47:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:47:05,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:05,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:05,479 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:05,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1927722319, now seen corresponding path program 1 times [2019-12-27 18:47:05,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:05,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904808562] [2019-12-27 18:47:05,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:05,626 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:47:05,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904808562] [2019-12-27 18:47:05,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:05,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:05,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [160430620] [2019-12-27 18:47:05,629 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:05,704 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:05,783 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 139 states and 203 transitions. [2019-12-27 18:47:05,783 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:05,817 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:47:05,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:47:05,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:05,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:47:05,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:47:05,819 INFO L87 Difference]: Start difference. First operand 605 states and 1415 transitions. Second operand 5 states. [2019-12-27 18:47:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:06,018 INFO L93 Difference]: Finished difference Result 779 states and 1770 transitions. [2019-12-27 18:47:06,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:47:06,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2019-12-27 18:47:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:06,020 INFO L225 Difference]: With dead ends: 779 [2019-12-27 18:47:06,020 INFO L226 Difference]: Without dead ends: 779 [2019-12-27 18:47:06,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:47:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-12-27 18:47:06,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 605. [2019-12-27 18:47:06,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-12-27 18:47:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 1389 transitions. [2019-12-27 18:47:06,031 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 1389 transitions. Word has length 54 [2019-12-27 18:47:06,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:06,031 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 1389 transitions. [2019-12-27 18:47:06,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:47:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 1389 transitions. [2019-12-27 18:47:06,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:47:06,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:06,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:06,034 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:06,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:06,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1649873410, now seen corresponding path program 1 times [2019-12-27 18:47:06,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:06,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9506299] [2019-12-27 18:47:06,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:06,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:06,186 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:47:06,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9506299] [2019-12-27 18:47:06,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:06,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 18:47:06,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1459800444] [2019-12-27 18:47:06,188 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:06,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:06,268 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 141 states and 201 transitions. [2019-12-27 18:47:06,268 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:06,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:47:06,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:47:06,421 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 18:47:06,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:47:06,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:06,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:47:06,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:47:06,422 INFO L87 Difference]: Start difference. First operand 605 states and 1389 transitions. Second operand 11 states. [2019-12-27 18:47:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:07,300 INFO L93 Difference]: Finished difference Result 1321 states and 3057 transitions. [2019-12-27 18:47:07,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:47:07,300 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-12-27 18:47:07,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:07,303 INFO L225 Difference]: With dead ends: 1321 [2019-12-27 18:47:07,303 INFO L226 Difference]: Without dead ends: 1321 [2019-12-27 18:47:07,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-12-27 18:47:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-12-27 18:47:07,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 759. [2019-12-27 18:47:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 18:47:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1758 transitions. [2019-12-27 18:47:07,319 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1758 transitions. Word has length 55 [2019-12-27 18:47:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:07,319 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1758 transitions. [2019-12-27 18:47:07,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:47:07,320 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1758 transitions. [2019-12-27 18:47:07,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:47:07,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:07,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:07,322 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:07,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:07,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1435069556, now seen corresponding path program 2 times [2019-12-27 18:47:07,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:07,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789505086] [2019-12-27 18:47:07,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:07,431 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:47:07,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789505086] [2019-12-27 18:47:07,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:07,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:47:07,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1881412793] [2019-12-27 18:47:07,432 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:07,452 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:07,517 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 149 transitions. [2019-12-27 18:47:07,518 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:07,519 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:47:07,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:47:07,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:07,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:47:07,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:47:07,520 INFO L87 Difference]: Start difference. First operand 759 states and 1758 transitions. Second operand 5 states. [2019-12-27 18:47:07,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:07,706 INFO L93 Difference]: Finished difference Result 923 states and 2111 transitions. [2019-12-27 18:47:07,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:47:07,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-27 18:47:07,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:07,708 INFO L225 Difference]: With dead ends: 923 [2019-12-27 18:47:07,708 INFO L226 Difference]: Without dead ends: 923 [2019-12-27 18:47:07,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:47:07,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-27 18:47:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 759. [2019-12-27 18:47:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-12-27 18:47:07,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1758 transitions. [2019-12-27 18:47:07,722 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1758 transitions. Word has length 55 [2019-12-27 18:47:07,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:07,723 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1758 transitions. [2019-12-27 18:47:07,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:47:07,723 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1758 transitions. [2019-12-27 18:47:07,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:47:07,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:07,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:07,726 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:07,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:07,726 INFO L82 PathProgramCache]: Analyzing trace with hash 2008175174, now seen corresponding path program 3 times [2019-12-27 18:47:07,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:07,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171660716] [2019-12-27 18:47:07,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:07,846 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:47:07,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171660716] [2019-12-27 18:47:07,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:07,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:47:07,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1215406384] [2019-12-27 18:47:07,847 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:07,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:07,925 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 170 transitions. [2019-12-27 18:47:07,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:07,926 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:47:07,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:47:07,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:07,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:47:07,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:47:07,927 INFO L87 Difference]: Start difference. First operand 759 states and 1758 transitions. Second operand 3 states. [2019-12-27 18:47:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:07,975 INFO L93 Difference]: Finished difference Result 759 states and 1757 transitions. [2019-12-27 18:47:07,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:47:07,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 18:47:07,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:07,979 INFO L225 Difference]: With dead ends: 759 [2019-12-27 18:47:07,980 INFO L226 Difference]: Without dead ends: 759 [2019-12-27 18:47:07,980 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:47:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-12-27 18:47:07,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 498. [2019-12-27 18:47:07,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2019-12-27 18:47:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 1149 transitions. [2019-12-27 18:47:07,991 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 1149 transitions. Word has length 55 [2019-12-27 18:47:07,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:07,991 INFO L462 AbstractCegarLoop]: Abstraction has 498 states and 1149 transitions. [2019-12-27 18:47:07,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:47:07,991 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 1149 transitions. [2019-12-27 18:47:07,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:47:07,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:07,993 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:07,993 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:07,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:07,994 INFO L82 PathProgramCache]: Analyzing trace with hash -529490788, now seen corresponding path program 1 times [2019-12-27 18:47:07,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:07,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101167507] [2019-12-27 18:47:07,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:08,133 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:47:08,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101167507] [2019-12-27 18:47:08,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:08,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:47:08,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [322599830] [2019-12-27 18:47:08,134 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:08,152 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:08,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 202 transitions. [2019-12-27 18:47:08,310 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:08,311 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:47:08,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:47:08,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:08,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:47:08,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:47:08,313 INFO L87 Difference]: Start difference. First operand 498 states and 1149 transitions. Second operand 6 states. [2019-12-27 18:47:08,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:08,384 INFO L93 Difference]: Finished difference Result 892 states and 1870 transitions. [2019-12-27 18:47:08,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:47:08,384 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 18:47:08,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:08,386 INFO L225 Difference]: With dead ends: 892 [2019-12-27 18:47:08,386 INFO L226 Difference]: Without dead ends: 579 [2019-12-27 18:47:08,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:47:08,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-12-27 18:47:08,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 436. [2019-12-27 18:47:08,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-12-27 18:47:08,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 970 transitions. [2019-12-27 18:47:08,395 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 970 transitions. Word has length 56 [2019-12-27 18:47:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:08,395 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 970 transitions. [2019-12-27 18:47:08,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:47:08,395 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 970 transitions. [2019-12-27 18:47:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:47:08,397 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:08,397 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:08,397 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:08,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:08,397 INFO L82 PathProgramCache]: Analyzing trace with hash -933211760, now seen corresponding path program 2 times [2019-12-27 18:47:08,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:08,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166321041] [2019-12-27 18:47:08,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:08,557 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:47:08,558 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166321041] [2019-12-27 18:47:08,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:08,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:47:08,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [277256170] [2019-12-27 18:47:08,559 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:08,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:08,739 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 242 transitions. [2019-12-27 18:47:08,739 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:08,857 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:47:08,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:47:08,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:08,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:47:08,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:47:08,858 INFO L87 Difference]: Start difference. First operand 436 states and 970 transitions. Second operand 9 states. [2019-12-27 18:47:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:09,099 INFO L93 Difference]: Finished difference Result 896 states and 1961 transitions. [2019-12-27 18:47:09,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 18:47:09,100 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2019-12-27 18:47:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:09,101 INFO L225 Difference]: With dead ends: 896 [2019-12-27 18:47:09,101 INFO L226 Difference]: Without dead ends: 335 [2019-12-27 18:47:09,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:47:09,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-12-27 18:47:09,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 220. [2019-12-27 18:47:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-12-27 18:47:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 387 transitions. [2019-12-27 18:47:09,106 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 387 transitions. Word has length 56 [2019-12-27 18:47:09,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:09,106 INFO L462 AbstractCegarLoop]: Abstraction has 220 states and 387 transitions. [2019-12-27 18:47:09,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:47:09,107 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 387 transitions. [2019-12-27 18:47:09,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:47:09,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:09,108 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47:09,108 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:09,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:09,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1590264344, now seen corresponding path program 3 times [2019-12-27 18:47:09,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:09,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828476678] [2019-12-27 18:47:09,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:09,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:09,438 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:47:09,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828476678] [2019-12-27 18:47:09,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:09,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 18:47:09,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [755764519] [2019-12-27 18:47:09,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:09,456 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:09,597 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 188 transitions. [2019-12-27 18:47:09,598 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:09,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 18:47:09,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 18:47:09,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 18:47:09,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 18:47:09,632 INFO L87 Difference]: Start difference. First operand 220 states and 387 transitions. Second operand 13 states. [2019-12-27 18:47:10,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:10,169 INFO L93 Difference]: Finished difference Result 384 states and 657 transitions. [2019-12-27 18:47:10,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:47:10,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 56 [2019-12-27 18:47:10,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:10,176 INFO L225 Difference]: With dead ends: 384 [2019-12-27 18:47:10,176 INFO L226 Difference]: Without dead ends: 354 [2019-12-27 18:47:10,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-12-27 18:47:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-12-27 18:47:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 320. [2019-12-27 18:47:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-27 18:47:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 558 transitions. [2019-12-27 18:47:10,181 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 558 transitions. Word has length 56 [2019-12-27 18:47:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:10,181 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 558 transitions. [2019-12-27 18:47:10,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 18:47:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 558 transitions. [2019-12-27 18:47:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:47:10,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:10,183 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:10,183 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:10,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:10,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1710889504, now seen corresponding path program 4 times [2019-12-27 18:47:10,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:10,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56631265] [2019-12-27 18:47:10,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:47:10,484 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:47:10,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56631265] [2019-12-27 18:47:10,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:47:10,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 18:47:10,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1662659724] [2019-12-27 18:47:10,485 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:47:10,507 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:47:10,599 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 124 states and 173 transitions. [2019-12-27 18:47:10,599 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:47:10,623 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:47:10,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 18:47:10,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:47:10,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 18:47:10,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:47:10,625 INFO L87 Difference]: Start difference. First operand 320 states and 558 transitions. Second operand 12 states. [2019-12-27 18:47:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:47:10,897 INFO L93 Difference]: Finished difference Result 420 states and 708 transitions. [2019-12-27 18:47:10,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 18:47:10,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-27 18:47:10,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:47:10,898 INFO L225 Difference]: With dead ends: 420 [2019-12-27 18:47:10,898 INFO L226 Difference]: Without dead ends: 390 [2019-12-27 18:47:10,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:47:10,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-12-27 18:47:10,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 328. [2019-12-27 18:47:10,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2019-12-27 18:47:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 572 transitions. [2019-12-27 18:47:10,905 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 572 transitions. Word has length 56 [2019-12-27 18:47:10,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:47:10,905 INFO L462 AbstractCegarLoop]: Abstraction has 328 states and 572 transitions. [2019-12-27 18:47:10,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 18:47:10,905 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 572 transitions. [2019-12-27 18:47:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:47:10,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:47:10,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:47:10,909 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:47:10,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:47:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1475134232, now seen corresponding path program 5 times [2019-12-27 18:47:10,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:47:10,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379639806] [2019-12-27 18:47:10,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:47:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:47:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:47:11,087 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:47:11,087 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:47:11,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] ULTIMATE.startENTRY-->L798: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#memory_int_23| (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2498~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2498~0.base_27|) |v_ULTIMATE.start_main_~#t2498~0.offset_20| 0))) (= (store .cse0 |v_ULTIMATE.start_main_~#t2498~0.base_27| 1) |v_#valid_59|) (= 0 v_~y$r_buff1_thd1~0_54) (= (select .cse0 |v_ULTIMATE.start_main_~#t2498~0.base_27|) 0) (= 0 v_~y$r_buff1_thd3~0_115) (= 0 v_~y$r_buff1_thd2~0_106) (= v_~weak$$choice2~0_112 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~y$r_buff0_thd0~0_348 0) (= v_~y$w_buff0_used~0_737 0) (= v_~y$w_buff1~0_230 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff0_thd3~0_169) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2498~0.base_27|) (= |v_ULTIMATE.start_main_~#t2498~0.offset_20| 0) (= 0 v_~y$w_buff0~0_338) (< 0 |v_#StackHeapBarrier_18|) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2498~0.base_27| 4)) (= 0 v_~y$r_buff0_thd2~0_108) (= v_~y$mem_tmp~0_19 0) (= v_~z~0_90 0) (= v_~x~0_77 0) (= v_~y$w_buff1_used~0_407 0) (= v_~main$tmp_guard0~0_21 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= 0 v_~__unbuffered_cnt~0_90) (= v_~y$r_buff1_thd0~0_237 0) (= 0 v_~y$flush_delayed~0_38) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_34|, ULTIMATE.start_main_~#t2499~0.offset=|v_ULTIMATE.start_main_~#t2499~0.offset_17|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_39|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_62|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_71|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_19, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_115, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_17|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_118|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_45|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_34|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_37|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_40|, ~y$w_buff1~0=v_~y$w_buff1~0_230, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_9|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_237, ~x~0=v_~x~0_77, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t2499~0.base=|v_ULTIMATE.start_main_~#t2499~0.base_20|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_737, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_45|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_36|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_37|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_43|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_24|, ULTIMATE.start_main_~#t2500~0.offset=|v_ULTIMATE.start_main_~#t2500~0.offset_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_31|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_54, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~y$w_buff0~0=v_~y$w_buff0~0_338, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_169, ~y~0=v_~y~0_150, ULTIMATE.start_main_~#t2498~0.offset=|v_ULTIMATE.start_main_~#t2498~0.offset_20|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_37|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_17|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_206|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_114|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_42|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_348, #valid=|v_#valid_59|, ULTIMATE.start_main_~#t2500~0.base=|v_ULTIMATE.start_main_~#t2500~0.base_20|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t2498~0.base=|v_ULTIMATE.start_main_~#t2498~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_90, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t2499~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2499~0.base, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2500~0.offset, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_~#t2498~0.offset, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t2500~0.base, #memory_int, ULTIMATE.start_main_~#t2498~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:47:11,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L798-1-->L800: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2499~0.base_9| 1)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2499~0.base_9|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2499~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2499~0.base_9|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2499~0.base_9| 4) |v_#length_15|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2499~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2499~0.base_9|) |v_ULTIMATE.start_main_~#t2499~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2499~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2499~0.base=|v_ULTIMATE.start_main_~#t2499~0.base_9|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2499~0.offset=|v_ULTIMATE.start_main_~#t2499~0.offset_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2499~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t2499~0.offset, ULTIMATE.start_main_#t~nondet15, #length] because there is no mapped edge [2019-12-27 18:47:11,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L800-1-->L802: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2500~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2500~0.base_10|) |v_ULTIMATE.start_main_~#t2500~0.offset_9| 2)) |v_#memory_int_11|) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2500~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t2500~0.offset_9|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2500~0.base_10| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t2500~0.base_10|)) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2500~0.base_10|)) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2500~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t2500~0.base=|v_ULTIMATE.start_main_~#t2500~0.base_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2500~0.offset=|v_ULTIMATE.start_main_~#t2500~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2500~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t2500~0.offset] because there is no mapped edge [2019-12-27 18:47:11,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P2ENTRY-->L4-3: Formula: (and (= 1 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out763806539|) (= 2 ~y$w_buff0~0_Out763806539) (= |P2Thread1of1ForFork0_#in~arg.base_In763806539| P2Thread1of1ForFork0_~arg.base_Out763806539) (= 1 ~y$w_buff0_used~0_Out763806539) (= 0 (mod ~y$w_buff1_used~0_Out763806539 256)) (= ~y$w_buff0_used~0_In763806539 ~y$w_buff1_used~0_Out763806539) (= |P2Thread1of1ForFork0_#in~arg.offset_In763806539| P2Thread1of1ForFork0_~arg.offset_Out763806539) (= ~y$w_buff1~0_Out763806539 ~y$w_buff0~0_In763806539) (= P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out763806539 |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out763806539|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In763806539|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In763806539, ~y$w_buff0~0=~y$w_buff0~0_In763806539, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In763806539|} OutVars{P2Thread1of1ForFork0_~arg.base=P2Thread1of1ForFork0_~arg.base_Out763806539, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out763806539|, P2Thread1of1ForFork0_#in~arg.offset=|P2Thread1of1ForFork0_#in~arg.offset_In763806539|, ~y$w_buff0_used~0=~y$w_buff0_used~0_Out763806539, ~y$w_buff1~0=~y$w_buff1~0_Out763806539, ~y$w_buff0~0=~y$w_buff0~0_Out763806539, P2Thread1of1ForFork0_~arg.offset=P2Thread1of1ForFork0_~arg.offset_Out763806539, P2Thread1of1ForFork0_#in~arg.base=|P2Thread1of1ForFork0_#in~arg.base_In763806539|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=P2Thread1of1ForFork0___VERIFIER_assert_~expression_Out763806539, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out763806539} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 18:47:11,096 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_60 1) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= v_~z~0_51 2) (= v_P0Thread1of1ForFork1_~arg.offset_17 |v_P0Thread1of1ForFork1_#in~arg.offset_17|) (= |v_P0Thread1of1ForFork1_#in~arg.base_17| v_P0Thread1of1ForFork1_~arg.base_17)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_17|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, ~z~0=v_~z~0_51, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_17|, ~x~0=v_~x~0_60, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_17} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 18:47:11,097 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L776-->L776-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1200235480 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1200235480 256)))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out-1200235480| 0)) (and (= ~y$w_buff0_used~0_In-1200235480 |P2Thread1of1ForFork0_#t~ite11_Out-1200235480|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200235480, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1200235480} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1200235480, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out-1200235480|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1200235480} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-27 18:47:11,098 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L746-2-->L746-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-1416888998 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1416888998 256) 0)) (.cse0 (= |P1Thread1of1ForFork2_#t~ite4_Out-1416888998| |P1Thread1of1ForFork2_#t~ite3_Out-1416888998|))) (or (and .cse0 (= |P1Thread1of1ForFork2_#t~ite3_Out-1416888998| ~y~0_In-1416888998) (or .cse1 .cse2)) (and (not .cse2) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out-1416888998| ~y$w_buff1~0_In-1416888998) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1416888998, ~y$w_buff1~0=~y$w_buff1~0_In-1416888998, ~y~0=~y~0_In-1416888998, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1416888998} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1416888998, ~y$w_buff1~0=~y$w_buff1~0_In-1416888998, P1Thread1of1ForFork2_#t~ite4=|P1Thread1of1ForFork2_#t~ite4_Out-1416888998|, ~y~0=~y~0_In-1416888998, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out-1416888998|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1416888998} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 18:47:11,099 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1061096087 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-1061096087 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1061096087 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1061096087 256)))) (or (and (= ~y$w_buff1_used~0_In-1061096087 |P2Thread1of1ForFork0_#t~ite12_Out-1061096087|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite12_Out-1061096087|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1061096087, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1061096087, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1061096087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1061096087} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1061096087, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1061096087, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1061096087|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1061096087, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1061096087} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-27 18:47:11,100 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1622214867 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1622214867 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite5_Out-1622214867|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1622214867 |P1Thread1of1ForFork2_#t~ite5_Out-1622214867|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1622214867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1622214867} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1622214867, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1622214867, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out-1622214867|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 18:47:11,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L748-->L748-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1331883365 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1331883365 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In1331883365 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In1331883365 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite6_Out1331883365| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite6_Out1331883365| ~y$w_buff1_used~0_In1331883365) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331883365, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331883365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331883365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331883365} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1331883365, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1331883365, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1331883365, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out1331883365|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1331883365} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 18:47:11,101 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L749-->L749-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1632935703 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1632935703 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out-1632935703| 0)) (and (= ~y$r_buff0_thd2~0_In-1632935703 |P1Thread1of1ForFork2_#t~ite7_Out-1632935703|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1632935703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1632935703} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1632935703, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1632935703, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out-1632935703|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 18:47:11,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [676] [676] L750-->L750-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In1941385021 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1941385021 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In1941385021 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1941385021 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite8_Out1941385021| ~y$r_buff1_thd2~0_In1941385021)) (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out1941385021|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1941385021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1941385021, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1941385021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1941385021} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1941385021, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1941385021, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out1941385021|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1941385021, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1941385021} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 18:47:11,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L750-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite8_36| v_~y$r_buff1_thd2~0_71) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_71, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 18:47:11,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-473152180 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-473152180 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-473152180 0)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out-473152180 ~y$r_buff0_thd3~0_In-473152180)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-473152180, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-473152180} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-473152180, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-473152180, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-473152180|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-27 18:47:11,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-574163224 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-574163224 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-574163224 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-574163224 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out-574163224| 0)) (and (= |P2Thread1of1ForFork0_#t~ite14_Out-574163224| ~y$r_buff1_thd3~0_In-574163224) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-574163224, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-574163224, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-574163224, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-574163224} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out-574163224|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-574163224, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-574163224, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-574163224, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-574163224} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-27 18:47:11,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L779-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= |v_P2Thread1of1ForFork0_#t~ite14_34| v_~y$r_buff1_thd3~0_66)) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_33|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_66, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 18:47:11,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L802-1-->L808: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:47:11,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L808-2-->L808-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1888697326 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1888697326 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-1888697326| |ULTIMATE.start_main_#t~ite18_Out-1888697326|))) (or (and (or .cse0 .cse1) (= ~y~0_In-1888697326 |ULTIMATE.start_main_#t~ite18_Out-1888697326|) .cse2) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In-1888697326 |ULTIMATE.start_main_#t~ite18_Out-1888697326|) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1888697326, ~y~0=~y~0_In-1888697326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1888697326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1888697326} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1888697326, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-1888697326|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-1888697326|, ~y~0=~y~0_In-1888697326, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1888697326, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1888697326} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 18:47:11,104 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1658635280 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-1658635280 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1658635280 |ULTIMATE.start_main_#t~ite20_Out-1658635280|)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite20_Out-1658635280|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658635280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1658635280} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1658635280, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1658635280, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-1658635280|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 18:47:11,105 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L810-->L810-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In570855508 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In570855508 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In570855508 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In570855508 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite21_Out570855508|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite21_Out570855508| ~y$w_buff1_used~0_In570855508) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In570855508, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In570855508, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In570855508, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570855508} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In570855508, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In570855508, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out570855508|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In570855508, ~y$w_buff1_used~0=~y$w_buff1_used~0_In570855508} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 18:47:11,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-2623693 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2623693 256)))) (or (and (= ~y$r_buff0_thd0~0_In-2623693 |ULTIMATE.start_main_#t~ite22_Out-2623693|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-2623693|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2623693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2623693} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2623693, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2623693, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-2623693|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 18:47:11,106 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L812-->L812-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1919837780 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1919837780 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1919837780 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1919837780 256)))) (or (and (= ~y$r_buff1_thd0~0_In-1919837780 |ULTIMATE.start_main_#t~ite23_Out-1919837780|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out-1919837780|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1919837780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1919837780, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1919837780, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1919837780} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1919837780, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1919837780, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1919837780, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1919837780|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1919837780} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 18:47:11,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L820-->L820-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-554895086 256)))) (or (and .cse0 (= ~y$w_buff0~0_In-554895086 |ULTIMATE.start_main_#t~ite29_Out-554895086|) (= |ULTIMATE.start_main_#t~ite30_Out-554895086| |ULTIMATE.start_main_#t~ite29_Out-554895086|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-554895086 256)))) (or (= (mod ~y$w_buff0_used~0_In-554895086 256) 0) (and (= (mod ~y$r_buff1_thd0~0_In-554895086 256) 0) .cse1) (and (= 0 (mod ~y$w_buff1_used~0_In-554895086 256)) .cse1)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite30_Out-554895086| ~y$w_buff0~0_In-554895086) (= |ULTIMATE.start_main_#t~ite29_In-554895086| |ULTIMATE.start_main_#t~ite29_Out-554895086|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-554895086, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-554895086|, ~y$w_buff0~0=~y$w_buff0~0_In-554895086, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-554895086, ~weak$$choice2~0=~weak$$choice2~0_In-554895086, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-554895086, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-554895086} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-554895086|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-554895086, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-554895086|, ~y$w_buff0~0=~y$w_buff0~0_In-554895086, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-554895086, ~weak$$choice2~0=~weak$$choice2~0_In-554895086, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-554895086, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-554895086} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:47:11,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L821-->L821-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1009469217 256)))) (or (and (= |ULTIMATE.start_main_#t~ite33_Out1009469217| |ULTIMATE.start_main_#t~ite32_Out1009469217|) .cse0 (= ~y$w_buff1~0_In1009469217 |ULTIMATE.start_main_#t~ite32_Out1009469217|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1009469217 256) 0))) (or (and .cse1 (= (mod ~y$r_buff1_thd0~0_In1009469217 256) 0)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In1009469217 256))) (= (mod ~y$w_buff0_used~0_In1009469217 256) 0)))) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite32_In1009469217| |ULTIMATE.start_main_#t~ite32_Out1009469217|) (= ~y$w_buff1~0_In1009469217 |ULTIMATE.start_main_#t~ite33_Out1009469217|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1009469217, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1009469217, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1009469217, ~weak$$choice2~0=~weak$$choice2~0_In1009469217, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1009469217, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_In1009469217|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1009469217} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1009469217, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1009469217, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1009469217, ~weak$$choice2~0=~weak$$choice2~0_In1009469217, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out1009469217|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1009469217, ULTIMATE.start_main_#t~ite33=|ULTIMATE.start_main_#t~ite33_Out1009469217|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1009469217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_#t~ite33] because there is no mapped edge [2019-12-27 18:47:11,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In133706701 256)))) (or (and (= |ULTIMATE.start_main_#t~ite35_Out133706701| |ULTIMATE.start_main_#t~ite36_Out133706701|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In133706701 256)))) (or (and (= (mod ~y$w_buff1_used~0_In133706701 256) 0) .cse0) (= 0 (mod ~y$w_buff0_used~0_In133706701 256)) (and .cse0 (= 0 (mod ~y$r_buff1_thd0~0_In133706701 256))))) (= |ULTIMATE.start_main_#t~ite35_Out133706701| ~y$w_buff0_used~0_In133706701) .cse1) (and (= ~y$w_buff0_used~0_In133706701 |ULTIMATE.start_main_#t~ite36_Out133706701|) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_In133706701| |ULTIMATE.start_main_#t~ite35_Out133706701|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In133706701, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In133706701, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In133706701|, ~weak$$choice2~0=~weak$$choice2~0_In133706701, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In133706701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In133706701} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In133706701, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In133706701, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out133706701|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out133706701|, ~weak$$choice2~0=~weak$$choice2~0_In133706701, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In133706701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In133706701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 18:47:11,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L824-->L825-8: Formula: (and (= v_~y$r_buff1_thd0~0_226 |v_ULTIMATE.start_main_#t~ite45_60|) (not (= 0 (mod v_~weak$$choice2~0_105 256))) (= |v_ULTIMATE.start_main_#t~ite43_49| |v_ULTIMATE.start_main_#t~ite43_48|) (= |v_ULTIMATE.start_main_#t~ite44_49| |v_ULTIMATE.start_main_#t~ite44_48|) (= v_~y$r_buff0_thd0~0_339 v_~y$r_buff0_thd0~0_338)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_339, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_49|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_49|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_37|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_35|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_338, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_48|, ~weak$$choice2~0=v_~weak$$choice2~0_105, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_226, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_19|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_60|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_48|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:47:11,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L827-->L830-1: Formula: (and (= (mod v_~main$tmp_guard1~0_21 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_~y~0_89 v_~y$mem_tmp~0_11) (= 0 v_~y$flush_delayed~0_23) (not (= (mod v_~y$flush_delayed~0_24 256) 0))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ~y~0=v_~y~0_89, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 18:47:11,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L830-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 18:47:11,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:47:11 BasicIcfg [2019-12-27 18:47:11,196 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:47:11,197 INFO L168 Benchmark]: Toolchain (without parser) took 20051.94 ms. Allocated memory was 137.9 MB in the beginning and 893.4 MB in the end (delta: 755.5 MB). Free memory was 101.1 MB in the beginning and 314.1 MB in the end (delta: -213.1 MB). Peak memory consumption was 542.4 MB. Max. memory is 7.1 GB. [2019-12-27 18:47:11,198 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 18:47:11,199 INFO L168 Benchmark]: CACSL2BoogieTranslator took 772.63 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.6 MB in the beginning and 156.8 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-27 18:47:11,203 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.33 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.1 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:47:11,203 INFO L168 Benchmark]: Boogie Preprocessor took 45.66 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:47:11,204 INFO L168 Benchmark]: RCFGBuilder took 829.80 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 105.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:47:11,205 INFO L168 Benchmark]: TraceAbstraction took 18317.46 ms. Allocated memory was 202.9 MB in the beginning and 893.4 MB in the end (delta: 690.5 MB). Free memory was 104.8 MB in the beginning and 314.1 MB in the end (delta: -209.4 MB). Peak memory consumption was 481.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:47:11,212 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 772.63 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.6 MB in the beginning and 156.8 MB in the end (delta: -56.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.33 ms. Allocated memory is still 202.9 MB. Free memory was 156.8 MB in the beginning and 154.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.66 ms. Allocated memory is still 202.9 MB. Free memory was 154.1 MB in the beginning and 151.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 829.80 ms. Allocated memory is still 202.9 MB. Free memory was 151.4 MB in the beginning and 105.4 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18317.46 ms. Allocated memory was 202.9 MB in the beginning and 893.4 MB in the end (delta: 690.5 MB). Free memory was 104.8 MB in the beginning and 314.1 MB in the end (delta: -209.4 MB). Peak memory consumption was 481.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 161 ProgramPointsBefore, 81 ProgramPointsAfterwards, 192 TransitionsBefore, 86 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 30 ChoiceCompositions, 4050 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 227 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 46210 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L798] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L765] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L769] 3 y$r_buff0_thd3 = (_Bool)1 [L772] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 x = 2 [L743] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L775] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L746] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L776] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L746] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L747] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L748] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L749] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L808] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L808] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L809] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L810] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L811] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L812] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L815] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 0 y$flush_delayed = weak$$choice2 [L818] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L820] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L821] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L822] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L825] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L826] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 152 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.0s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1299 SDtfs, 1479 SDslu, 3370 SDs, 0 SdLazy, 1780 SolverSat, 115 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 159 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=21678occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 4262 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 626 NumberOfCodeBlocks, 626 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 141176 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...