/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/mix031_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:44:54,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:44:54,870 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:44:54,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:44:54,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:44:54,891 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:44:54,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:44:54,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:44:54,907 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:44:54,909 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:44:54,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:44:54,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:44:54,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:44:54,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:44:54,918 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:44:54,919 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:44:54,920 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:44:54,922 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:44:54,924 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:44:54,929 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:44:54,933 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:44:54,938 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:44:54,939 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:44:54,939 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:44:54,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:44:54,942 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:44:54,942 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:44:54,943 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:44:54,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:44:54,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:44:54,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:44:54,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:44:54,947 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:44:54,948 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:44:54,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:44:54,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:44:54,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:44:54,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:44:54,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:44:54,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:44:54,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:44:54,953 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 16:44:54,987 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:44:54,988 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:44:54,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:44:54,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:44:54,992 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:44:54,992 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:44:54,992 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:44:54,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:44:54,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:44:54,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:44:54,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:44:54,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:44:54,993 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:44:54,993 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:44:54,993 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:44:54,994 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:44:54,994 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:44:54,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:44:54,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:44:54,994 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:44:54,995 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:44:54,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:44:54,995 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:44:54,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:44:54,995 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:44:54,996 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:44:54,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:44:54,996 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:44:54,996 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:44:54,996 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:44:54,997 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:44:55,287 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:44:55,307 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:44:55,310 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:44:55,312 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:44:55,313 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:44:55,314 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_pso.opt.i [2019-12-27 16:44:55,385 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15806d0c/6b0e219eac724e7ca04bb4ac99d8d45d/FLAGb97352469 [2019-12-27 16:44:55,869 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:44:55,870 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_pso.opt.i [2019-12-27 16:44:55,895 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15806d0c/6b0e219eac724e7ca04bb4ac99d8d45d/FLAGb97352469 [2019-12-27 16:44:56,133 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e15806d0c/6b0e219eac724e7ca04bb4ac99d8d45d [2019-12-27 16:44:56,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:44:56,145 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:44:56,146 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:44:56,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:44:56,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:44:56,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:56,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c1a131a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56, skipping insertion in model container [2019-12-27 16:44:56,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:56,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:44:56,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:44:56,763 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:44:56,775 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:44:56,859 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:44:56,927 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:44:56,927 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56 WrapperNode [2019-12-27 16:44:56,927 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:44:56,928 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:44:56,928 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:44:56,928 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:44:56,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:56,956 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:56,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:44:56,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:44:56,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:44:56,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:44:56,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:56,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:57,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:57,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:57,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:57,022 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:57,025 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (1/1) ... [2019-12-27 16:44:57,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:44:57,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:44:57,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:44:57,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:44:57,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (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 16:44:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:44:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:44:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:44:57,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:44:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:44:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:44:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:44:57,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:44:57,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:44:57,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:44:57,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:44:57,109 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 16:44:57,767 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:44:57,767 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:44:57,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:44:57 BoogieIcfgContainer [2019-12-27 16:44:57,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:44:57,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:44:57,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:44:57,775 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:44:57,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:44:56" (1/3) ... [2019-12-27 16:44:57,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21575cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:44:57, skipping insertion in model container [2019-12-27 16:44:57,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:44:56" (2/3) ... [2019-12-27 16:44:57,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21575cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:44:57, skipping insertion in model container [2019-12-27 16:44:57,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:44:57" (3/3) ... [2019-12-27 16:44:57,780 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_pso.opt.i [2019-12-27 16:44:57,791 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:44:57,792 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:44:57,801 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:44:57,802 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:44:57,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,843 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,845 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,846 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,847 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,848 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,852 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,853 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,854 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,855 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,856 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,857 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,861 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,862 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,864 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,865 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,868 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,875 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,876 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,879 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,880 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,881 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,884 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,886 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,888 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,888 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,892 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,893 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,904 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,905 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,906 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,907 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,914 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,921 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,921 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:44:57,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 16:44:57,954 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:44:57,954 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:44:57,954 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:44:57,954 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:44:57,954 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:44:57,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:44:57,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:44:57,955 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:44:57,971 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-27 16:44:57,993 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 16:44:58,096 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 16:44:58,096 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:44:58,112 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 16:44:58,128 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 16:44:58,198 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 16:44:58,198 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:44:58,203 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 16:44:58,215 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 16:44:58,216 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:45:02,736 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-27 16:45:02,996 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 16:45:03,155 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 16:45:03,192 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-27 16:45:03,192 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 16:45:03,196 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-27 16:45:03,542 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-27 16:45:03,545 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-27 16:45:03,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 16:45:03,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:03,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 16:45:03,552 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:03,559 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-27 16:45:03,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:03,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767143423] [2019-12-27 16:45:03,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:03,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:03,819 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 16:45:03,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767143423] [2019-12-27 16:45:03,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:03,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:45:03,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1781408847] [2019-12-27 16:45:03,825 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:03,831 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:03,848 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 16:45:03,849 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:03,853 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:03,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:03,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:03,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:03,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:03,871 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-27 16:45:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:04,097 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-27 16:45:04,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:04,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 16:45:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:04,171 INFO L225 Difference]: With dead ends: 6414 [2019-12-27 16:45:04,172 INFO L226 Difference]: Without dead ends: 6042 [2019-12-27 16:45:04,173 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 16:45:04,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-27 16:45:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-27 16:45:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-27 16:45:04,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-27 16:45:04,700 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-27 16:45:04,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:04,700 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-27 16:45:04,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:04,701 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-27 16:45:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 16:45:04,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:04,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:04,705 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:04,705 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-27 16:45:04,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:04,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307815255] [2019-12-27 16:45:04,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:04,752 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 16:45:04,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307815255] [2019-12-27 16:45:04,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:04,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:04,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [684508779] [2019-12-27 16:45:04,753 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:04,754 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:04,756 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 16:45:04,756 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:04,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:04,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:04,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:04,759 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 3 states. [2019-12-27 16:45:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:04,783 INFO L93 Difference]: Finished difference Result 1215 states and 3009 transitions. [2019-12-27 16:45:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:04,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 16:45:04,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:04,793 INFO L225 Difference]: With dead ends: 1215 [2019-12-27 16:45:04,793 INFO L226 Difference]: Without dead ends: 1215 [2019-12-27 16:45:04,794 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 16:45:04,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-12-27 16:45:04,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-12-27 16:45:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-27 16:45:04,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3009 transitions. [2019-12-27 16:45:04,831 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3009 transitions. Word has length 11 [2019-12-27 16:45:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:04,831 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3009 transitions. [2019-12-27 16:45:04,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3009 transitions. [2019-12-27 16:45:04,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:04,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:04,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:04,834 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:04,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:04,834 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-27 16:45:04,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:04,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922582363] [2019-12-27 16:45:04,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:04,889 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 16:45:04,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922582363] [2019-12-27 16:45:04,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:04,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:04,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2062218193] [2019-12-27 16:45:04,891 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:04,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:04,898 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:45:04,899 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:04,960 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 16:45:04,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:04,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:04,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:04,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:04,962 INFO L87 Difference]: Start difference. First operand 1215 states and 3009 transitions. Second operand 5 states. [2019-12-27 16:45:05,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:05,082 INFO L93 Difference]: Finished difference Result 1870 states and 4688 transitions. [2019-12-27 16:45:05,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:05,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:45:05,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:05,094 INFO L225 Difference]: With dead ends: 1870 [2019-12-27 16:45:05,094 INFO L226 Difference]: Without dead ends: 1870 [2019-12-27 16:45:05,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-12-27 16:45:05,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1354. [2019-12-27 16:45:05,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2019-12-27 16:45:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 3400 transitions. [2019-12-27 16:45:05,145 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 3400 transitions. Word has length 14 [2019-12-27 16:45:05,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:05,145 INFO L462 AbstractCegarLoop]: Abstraction has 1354 states and 3400 transitions. [2019-12-27 16:45:05,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:05,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 3400 transitions. [2019-12-27 16:45:05,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:05,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:05,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:05,147 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:05,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:05,148 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-27 16:45:05,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:05,149 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264860931] [2019-12-27 16:45:05,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:05,228 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 16:45:05,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264860931] [2019-12-27 16:45:05,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:05,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:05,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1744813813] [2019-12-27 16:45:05,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:05,232 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:05,237 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:45:05,237 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:05,255 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:05,255 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:05,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:05,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:05,256 INFO L87 Difference]: Start difference. First operand 1354 states and 3400 transitions. Second operand 5 states. [2019-12-27 16:45:05,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:05,459 INFO L93 Difference]: Finished difference Result 1775 states and 4313 transitions. [2019-12-27 16:45:05,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:45:05,460 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:45:05,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:05,471 INFO L225 Difference]: With dead ends: 1775 [2019-12-27 16:45:05,472 INFO L226 Difference]: Without dead ends: 1775 [2019-12-27 16:45:05,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:05,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-27 16:45:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1643. [2019-12-27 16:45:05,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2019-12-27 16:45:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 4018 transitions. [2019-12-27 16:45:05,520 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 4018 transitions. Word has length 14 [2019-12-27 16:45:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:05,521 INFO L462 AbstractCegarLoop]: Abstraction has 1643 states and 4018 transitions. [2019-12-27 16:45:05,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 4018 transitions. [2019-12-27 16:45:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 16:45:05,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:05,522 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:05,522 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:05,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:05,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-27 16:45:05,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:05,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911238638] [2019-12-27 16:45:05,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:05,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:05,622 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 16:45:05,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911238638] [2019-12-27 16:45:05,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:05,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:05,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1115729719] [2019-12-27 16:45:05,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:05,625 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:05,629 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 16:45:05,629 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:05,646 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:05,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:05,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:05,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:05,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:05,647 INFO L87 Difference]: Start difference. First operand 1643 states and 4018 transitions. Second operand 5 states. [2019-12-27 16:45:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:05,857 INFO L93 Difference]: Finished difference Result 2036 states and 4889 transitions. [2019-12-27 16:45:05,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:45:05,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 16:45:05,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:05,870 INFO L225 Difference]: With dead ends: 2036 [2019-12-27 16:45:05,870 INFO L226 Difference]: Without dead ends: 2036 [2019-12-27 16:45:05,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:05,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2019-12-27 16:45:05,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1664. [2019-12-27 16:45:05,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-12-27 16:45:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-12-27 16:45:06,005 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 14 [2019-12-27 16:45:06,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:06,005 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-12-27 16:45:06,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:06,006 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-12-27 16:45:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 16:45:06,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:06,008 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 16:45:06,009 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:06,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-27 16:45:06,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:06,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190617754] [2019-12-27 16:45:06,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:06,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:06,105 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 16:45:06,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190617754] [2019-12-27 16:45:06,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:06,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:06,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [508762073] [2019-12-27 16:45:06,106 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:06,113 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:06,135 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 57 states and 86 transitions. [2019-12-27 16:45:06,135 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:06,152 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:06,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:06,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:06,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:06,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:06,154 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 5 states. [2019-12-27 16:45:06,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:06,192 INFO L93 Difference]: Finished difference Result 723 states and 1652 transitions. [2019-12-27 16:45:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:45:06,193 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 16:45:06,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:06,197 INFO L225 Difference]: With dead ends: 723 [2019-12-27 16:45:06,197 INFO L226 Difference]: Without dead ends: 723 [2019-12-27 16:45:06,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-27 16:45:06,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 703. [2019-12-27 16:45:06,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-27 16:45:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1612 transitions. [2019-12-27 16:45:06,215 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1612 transitions. Word has length 26 [2019-12-27 16:45:06,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:06,215 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1612 transitions. [2019-12-27 16:45:06,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:06,216 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1612 transitions. [2019-12-27 16:45:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:45:06,218 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:06,218 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:06,218 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:06,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:06,219 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-12-27 16:45:06,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:06,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756357000] [2019-12-27 16:45:06,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:06,326 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 16:45:06,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756357000] [2019-12-27 16:45:06,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:06,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:45:06,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409496831] [2019-12-27 16:45:06,329 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:06,342 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:06,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 83 states and 115 transitions. [2019-12-27 16:45:06,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:06,396 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:45:06,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:45:06,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:45:06,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:45:06,397 INFO L87 Difference]: Start difference. First operand 703 states and 1612 transitions. Second operand 5 states. [2019-12-27 16:45:06,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:06,424 INFO L93 Difference]: Finished difference Result 1112 states and 2596 transitions. [2019-12-27 16:45:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:45:06,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-27 16:45:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:06,427 INFO L225 Difference]: With dead ends: 1112 [2019-12-27 16:45:06,427 INFO L226 Difference]: Without dead ends: 428 [2019-12-27 16:45:06,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:06,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-27 16:45:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-12-27 16:45:06,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-12-27 16:45:06,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1015 transitions. [2019-12-27 16:45:06,439 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1015 transitions. Word has length 41 [2019-12-27 16:45:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:06,439 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 1015 transitions. [2019-12-27 16:45:06,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:45:06,439 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1015 transitions. [2019-12-27 16:45:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:45:06,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:06,441 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:06,441 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:06,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:06,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1541326249, now seen corresponding path program 2 times [2019-12-27 16:45:06,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:06,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501077741] [2019-12-27 16:45:06,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:06,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:06,535 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 16:45:06,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501077741] [2019-12-27 16:45:06,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:06,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:45:06,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108085961] [2019-12-27 16:45:06,536 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:06,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:06,574 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 76 transitions. [2019-12-27 16:45:06,574 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:06,584 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:45:06,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:45:06,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:06,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:45:06,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:45:06,586 INFO L87 Difference]: Start difference. First operand 428 states and 1015 transitions. Second operand 7 states. [2019-12-27 16:45:06,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:06,760 INFO L93 Difference]: Finished difference Result 824 states and 1900 transitions. [2019-12-27 16:45:06,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 16:45:06,761 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 16:45:06,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:06,766 INFO L225 Difference]: With dead ends: 824 [2019-12-27 16:45:06,766 INFO L226 Difference]: Without dead ends: 536 [2019-12-27 16:45:06,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 16:45:06,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-27 16:45:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 476. [2019-12-27 16:45:06,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 16:45:06,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1097 transitions. [2019-12-27 16:45:06,779 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1097 transitions. Word has length 41 [2019-12-27 16:45:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:06,780 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1097 transitions. [2019-12-27 16:45:06,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:45:06,780 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1097 transitions. [2019-12-27 16:45:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:45:06,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:06,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:06,782 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1953316183, now seen corresponding path program 3 times [2019-12-27 16:45:06,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:06,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272824205] [2019-12-27 16:45:06,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:06,909 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 16:45:06,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272824205] [2019-12-27 16:45:06,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:06,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:45:06,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [350484529] [2019-12-27 16:45:06,910 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:06,920 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:07,030 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 101 transitions. [2019-12-27 16:45:07,031 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:07,042 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:45:07,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 16:45:07,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:07,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 16:45:07,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:45:07,044 INFO L87 Difference]: Start difference. First operand 476 states and 1097 transitions. Second operand 6 states. [2019-12-27 16:45:07,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:07,445 INFO L93 Difference]: Finished difference Result 808 states and 1797 transitions. [2019-12-27 16:45:07,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 16:45:07,446 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 16:45:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:07,455 INFO L225 Difference]: With dead ends: 808 [2019-12-27 16:45:07,455 INFO L226 Difference]: Without dead ends: 796 [2019-12-27 16:45:07,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 16:45:07,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-27 16:45:07,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 753. [2019-12-27 16:45:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-27 16:45:07,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1693 transitions. [2019-12-27 16:45:07,475 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1693 transitions. Word has length 41 [2019-12-27 16:45:07,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:07,475 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1693 transitions. [2019-12-27 16:45:07,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 16:45:07,475 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1693 transitions. [2019-12-27 16:45:07,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 16:45:07,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:07,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:07,478 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:07,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:07,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1269710711, now seen corresponding path program 4 times [2019-12-27 16:45:07,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:07,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946365304] [2019-12-27 16:45:07,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:45:07,584 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 16:45:07,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946365304] [2019-12-27 16:45:07,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:45:07,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:45:07,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1263847402] [2019-12-27 16:45:07,585 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:45:07,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:45:07,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 86 transitions. [2019-12-27 16:45:07,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:45:07,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:45:07,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:45:07,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:45:07,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:45:07,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:45:07,623 INFO L87 Difference]: Start difference. First operand 753 states and 1693 transitions. Second operand 3 states. [2019-12-27 16:45:07,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:45:07,637 INFO L93 Difference]: Finished difference Result 751 states and 1688 transitions. [2019-12-27 16:45:07,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:45:07,638 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 16:45:07,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:45:07,643 INFO L225 Difference]: With dead ends: 751 [2019-12-27 16:45:07,643 INFO L226 Difference]: Without dead ends: 751 [2019-12-27 16:45:07,643 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 16:45:07,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-12-27 16:45:07,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 695. [2019-12-27 16:45:07,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-27 16:45:07,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-12-27 16:45:07,660 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 41 [2019-12-27 16:45:07,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:45:07,661 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-12-27 16:45:07,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:45:07,661 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-12-27 16:45:07,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:45:07,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:45:07,664 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:45:07,664 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:45:07,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:45:07,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 1 times [2019-12-27 16:45:07,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:45:07,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42597447] [2019-12-27 16:45:07,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:45:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:45:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:45:07,790 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:45:07,790 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:45:07,794 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t839~0.base_37|) (= 0 |v_ULTIMATE.start_main_~#t839~0.offset_26|) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t839~0.base_37| 1)) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t839~0.base_37| 4)) (= v_~x~0_15 0) (= v_~y$r_buff1_thd0~0_156 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t839~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t839~0.base_37|) |v_ULTIMATE.start_main_~#t839~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$r_buff0_thd2~0_193) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= (select .cse0 |v_ULTIMATE.start_main_~#t839~0.base_37|) 0) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t840~0.base=|v_ULTIMATE.start_main_~#t840~0.base_23|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, ULTIMATE.start_main_~#t839~0.offset=|v_ULTIMATE.start_main_~#t839~0.offset_26|, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_~#t840~0.offset=|v_ULTIMATE.start_main_~#t840~0.offset_18|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_~#t839~0.base=|v_ULTIMATE.start_main_~#t839~0.base_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t840~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t839~0.offset, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t840~0.offset, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t839~0.base, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:45:07,795 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t840~0.base_12|) (not (= 0 |v_ULTIMATE.start_main_~#t840~0.base_12|)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t840~0.base_12| 4) |v_#length_9|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t840~0.base_12|)) (= |v_ULTIMATE.start_main_~#t840~0.offset_10| 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t840~0.base_12| 1) |v_#valid_27|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t840~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t840~0.base_12|) |v_ULTIMATE.start_main_~#t840~0.offset_10| 1)) |v_#memory_int_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t840~0.offset=|v_ULTIMATE.start_main_~#t840~0.offset_10|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_~#t840~0.base=|v_ULTIMATE.start_main_~#t840~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t840~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t840~0.base] because there is no mapped edge [2019-12-27 16:45:07,796 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (= ~y$r_buff1_thd0~0_Out-586892781 ~y$r_buff0_thd0~0_In-586892781) (= 1 ~z~0_Out-586892781) (= ~y$r_buff0_thd1~0_In-586892781 ~y$r_buff1_thd1~0_Out-586892781) (= ~__unbuffered_p1_EAX~0_Out-586892781 ~z~0_Out-586892781) (= ~y$r_buff1_thd2~0_Out-586892781 ~y$r_buff0_thd2~0_In-586892781) (not (= 0 P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-586892781)) (= ~__unbuffered_p1_EBX~0_Out-586892781 ~a~0_In-586892781) (= 1 ~y$r_buff0_thd2~0_Out-586892781)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-586892781, ~a~0=~a~0_In-586892781, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-586892781, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-586892781, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-586892781} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-586892781, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-586892781, ~a~0=~a~0_In-586892781, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-586892781, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-586892781, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-586892781, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-586892781, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-586892781, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-586892781, ~z~0=~z~0_Out-586892781, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-586892781} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:45:07,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In907002970 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In907002970 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite28_Out907002970|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out907002970| ~y$w_buff0_used~0_In907002970) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In907002970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In907002970} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In907002970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In907002970, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out907002970|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 16:45:07,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-286799129 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-286799129 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-286799129 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-286799129 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_Out-286799129| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite29_Out-286799129| ~y$w_buff1_used~0_In-286799129) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-286799129, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-286799129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-286799129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-286799129} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-286799129, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-286799129|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-286799129, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-286799129, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-286799129} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 16:45:07,804 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_11|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 16:45:07,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-934228394 256) 0))) (or (and (= ~y$r_buff1_thd1~0_In-934228394 |P0Thread1of1ForFork0_#t~ite23_Out-934228394|) (= |P0Thread1of1ForFork0_#t~ite23_Out-934228394| |P0Thread1of1ForFork0_#t~ite24_Out-934228394|) (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-934228394 256) 0))) (or (and .cse0 (= (mod ~y$r_buff1_thd1~0_In-934228394 256) 0)) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In-934228394 256))) (= (mod ~y$w_buff0_used~0_In-934228394 256) 0))) .cse1) (and (= |P0Thread1of1ForFork0_#t~ite23_In-934228394| |P0Thread1of1ForFork0_#t~ite23_Out-934228394|) (= ~y$r_buff1_thd1~0_In-934228394 |P0Thread1of1ForFork0_#t~ite24_Out-934228394|) (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-934228394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-934228394, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-934228394, ~weak$$choice2~0=~weak$$choice2~0_In-934228394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-934228394, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In-934228394|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-934228394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-934228394, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-934228394, ~weak$$choice2~0=~weak$$choice2~0_In-934228394, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out-934228394|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out-934228394|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-934228394} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 16:45:07,805 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_23|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 16:45:07,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-934004387 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-934004387 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-934004387 ~y$r_buff0_thd2~0_Out-934004387)) (and (= ~y$r_buff0_thd2~0_Out-934004387 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-934004387, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-934004387} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-934004387|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-934004387, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-934004387} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 16:45:07,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1388005306 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1388005306 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In1388005306 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In1388005306 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite31_Out1388005306| ~y$r_buff1_thd2~0_In1388005306)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite31_Out1388005306| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1388005306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1388005306, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1388005306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1388005306} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1388005306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1388005306, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out1388005306|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1388005306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1388005306} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 16:45:07,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= |v_P1Thread1of1ForFork1_#t~ite31_30| v_~y$r_buff1_thd2~0_59)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 16:45:07,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:45:07,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1282574310 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1282574310 256)))) (or (and (= ~y~0_In1282574310 |ULTIMATE.start_main_#t~ite34_Out1282574310|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1282574310 |ULTIMATE.start_main_#t~ite34_Out1282574310|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1282574310, ~y~0=~y~0_In1282574310, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1282574310, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282574310} OutVars{~y$w_buff1~0=~y$w_buff1~0_In1282574310, ~y~0=~y~0_In1282574310, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1282574310, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out1282574310|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1282574310} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 16:45:07,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 16:45:07,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1619923161 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1619923161 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite36_Out-1619923161| ~y$w_buff0_used~0_In-1619923161) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-1619923161| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1619923161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1619923161} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1619923161, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1619923161, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1619923161|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 16:45:07,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-511427055 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-511427055 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-511427055 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-511427055 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In-511427055 |ULTIMATE.start_main_#t~ite37_Out-511427055|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out-511427055| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-511427055, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-511427055, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-511427055, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-511427055} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-511427055, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-511427055, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-511427055|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-511427055, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-511427055} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 16:45:07,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1419965376 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1419965376 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite38_Out-1419965376|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out-1419965376| ~y$r_buff0_thd0~0_In-1419965376)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1419965376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1419965376} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1419965376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1419965376, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1419965376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 16:45:07,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1201023926 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1201023926 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1201023926 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1201023926 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out1201023926|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd0~0_In1201023926 |ULTIMATE.start_main_#t~ite39_Out1201023926|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1201023926, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1201023926, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1201023926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1201023926} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1201023926, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1201023926|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1201023926, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1201023926, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1201023926} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 16:45:07,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 1 v_~__unbuffered_p0_EAX~0_21) (= v_~main$tmp_guard1~0_19 0) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:45:07,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:45:07 BasicIcfg [2019-12-27 16:45:07,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:45:07,878 INFO L168 Benchmark]: Toolchain (without parser) took 11732.75 ms. Allocated memory was 144.7 MB in the beginning and 388.5 MB in the end (delta: 243.8 MB). Free memory was 101.1 MB in the beginning and 114.6 MB in the end (delta: -13.5 MB). Peak memory consumption was 230.3 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:07,879 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 16:45:07,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.92 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 157.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:07,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.86 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:07,881 INFO L168 Benchmark]: Boogie Preprocessor took 42.37 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:07,881 INFO L168 Benchmark]: RCFGBuilder took 738.89 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 111.1 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:07,882 INFO L168 Benchmark]: TraceAbstraction took 10105.61 ms. Allocated memory was 202.9 MB in the beginning and 388.5 MB in the end (delta: 185.6 MB). Free memory was 110.4 MB in the beginning and 114.6 MB in the end (delta: -4.2 MB). Peak memory consumption was 181.4 MB. Max. memory is 7.1 GB. [2019-12-27 16:45:07,886 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 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.92 ms. Allocated memory was 144.7 MB in the beginning and 202.9 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 157.7 MB in the end (delta: -57.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.86 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 154.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.37 ms. Allocated memory is still 202.9 MB. Free memory was 154.9 MB in the beginning and 152.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 738.89 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 111.1 MB in the end (delta: 41.7 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10105.61 ms. Allocated memory was 202.9 MB in the beginning and 388.5 MB in the end (delta: 185.6 MB). Free memory was 110.4 MB in the beginning and 114.6 MB in the end (delta: -4.2 MB). Peak memory consumption was 181.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t839, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L812] FCALL, FORK 0 pthread_create(&t840, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 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) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 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 [L818] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 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 [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.8s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1031 SDtfs, 807 SDslu, 1932 SDs, 0 SdLazy, 829 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 1199 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 36902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...