/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 15:11:46,858 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 15:11:46,861 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 15:11:46,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 15:11:46,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 15:11:46,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 15:11:46,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 15:11:46,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 15:11:46,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 15:11:46,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 15:11:46,881 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 15:11:46,882 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 15:11:46,882 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 15:11:46,883 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 15:11:46,884 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 15:11:46,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 15:11:46,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 15:11:46,887 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 15:11:46,889 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 15:11:46,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 15:11:46,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 15:11:46,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 15:11:46,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 15:11:46,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 15:11:46,899 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 15:11:46,899 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 15:11:46,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 15:11:46,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 15:11:46,903 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 15:11:46,904 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 15:11:46,904 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 15:11:46,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 15:11:46,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 15:11:46,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 15:11:46,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 15:11:46,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 15:11:46,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 15:11:46,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 15:11:46,911 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 15:11:46,914 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 15:11:46,915 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 15:11:46,916 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 15:11:46,939 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 15:11:46,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 15:11:46,941 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 15:11:46,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 15:11:46,942 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 15:11:46,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 15:11:46,942 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 15:11:46,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 15:11:46,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 15:11:46,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 15:11:46,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 15:11:46,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 15:11:46,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 15:11:46,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 15:11:46,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 15:11:46,945 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 15:11:46,945 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 15:11:46,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 15:11:46,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 15:11:46,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 15:11:46,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 15:11:46,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 15:11:46,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 15:11:46,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 15:11:46,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 15:11:46,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 15:11:46,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 15:11:46,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 15:11:46,948 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 15:11:46,948 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 15:11:47,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 15:11:47,246 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 15:11:47,249 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 15:11:47,251 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 15:11:47,251 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 15:11:47,252 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-18 15:11:47,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01567eac8/4495d1ac9e5644e9a7bf8fa1fce9b84b/FLAG3e45975c0 [2019-12-18 15:11:47,903 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 15:11:47,904 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe034_power.oepc.i [2019-12-18 15:11:47,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01567eac8/4495d1ac9e5644e9a7bf8fa1fce9b84b/FLAG3e45975c0 [2019-12-18 15:11:48,176 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01567eac8/4495d1ac9e5644e9a7bf8fa1fce9b84b [2019-12-18 15:11:48,185 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 15:11:48,186 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 15:11:48,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 15:11:48,187 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 15:11:48,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 15:11:48,192 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:48,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@521bd42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48, skipping insertion in model container [2019-12-18 15:11:48,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:48,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 15:11:48,276 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 15:11:48,790 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:11:48,807 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 15:11:48,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 15:11:48,978 INFO L208 MainTranslator]: Completed translation [2019-12-18 15:11:48,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48 WrapperNode [2019-12-18 15:11:48,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 15:11:48,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 15:11:48,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 15:11:48,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 15:11:48,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,008 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 15:11:49,042 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 15:11:49,045 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 15:11:49,045 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 15:11:49,055 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,071 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,076 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,079 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (1/1) ... [2019-12-18 15:11:49,084 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 15:11:49,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 15:11:49,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 15:11:49,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 15:11:49,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (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-18 15:11:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 15:11:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 15:11:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 15:11:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 15:11:49,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 15:11:49,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 15:11:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 15:11:49,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 15:11:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 15:11:49,148 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 15:11:49,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 15:11:49,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 15:11:49,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 15:11:49,150 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 15:11:49,882 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 15:11:49,882 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 15:11:49,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:11:49 BoogieIcfgContainer [2019-12-18 15:11:49,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 15:11:49,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 15:11:49,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 15:11:49,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 15:11:49,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 03:11:48" (1/3) ... [2019-12-18 15:11:49,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d61f0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:11:49, skipping insertion in model container [2019-12-18 15:11:49,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 03:11:48" (2/3) ... [2019-12-18 15:11:49,891 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d61f0ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 03:11:49, skipping insertion in model container [2019-12-18 15:11:49,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 03:11:49" (3/3) ... [2019-12-18 15:11:49,893 INFO L109 eAbstractionObserver]: Analyzing ICFG safe034_power.oepc.i [2019-12-18 15:11:49,903 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 15:11:49,904 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 15:11:49,912 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 15:11:49,913 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 15:11:49,950 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,951 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,951 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,952 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,953 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,954 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,954 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,955 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,956 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,957 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,958 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,959 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,960 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,965 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,978 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,978 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,979 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,979 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,979 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,980 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,980 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,981 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,982 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,983 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,984 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,985 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,986 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,991 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:49,996 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,012 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,013 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,014 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,018 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,018 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,019 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,019 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,019 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,020 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 15:11:50,037 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 15:11:50,058 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 15:11:50,058 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 15:11:50,058 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 15:11:50,058 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 15:11:50,059 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 15:11:50,059 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 15:11:50,059 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 15:11:50,059 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 15:11:50,076 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 176 transitions [2019-12-18 15:11:50,078 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 15:11:50,152 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 15:11:50,153 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:11:50,172 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 15:11:50,193 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 151 places, 176 transitions [2019-12-18 15:11:50,275 INFO L126 PetriNetUnfolder]: 35/173 cut-off events. [2019-12-18 15:11:50,275 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 15:11:50,284 INFO L76 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 173 events. 35/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 342 event pairs. 9/145 useless extension candidates. Maximal degree in co-relation 143. Up to 2 conditions per place. [2019-12-18 15:11:50,301 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11400 [2019-12-18 15:11:50,302 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 15:11:55,176 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 15:11:55,294 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 15:11:55,520 INFO L206 etLargeBlockEncoding]: Checked pairs total: 63936 [2019-12-18 15:11:55,520 INFO L214 etLargeBlockEncoding]: Total number of compositions: 113 [2019-12-18 15:11:55,524 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 73 places, 82 transitions [2019-12-18 15:11:56,363 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14042 states. [2019-12-18 15:11:56,365 INFO L276 IsEmpty]: Start isEmpty. Operand 14042 states. [2019-12-18 15:11:56,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 15:11:56,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:11:56,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:11:56,372 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:11:56,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:11:56,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1097508166, now seen corresponding path program 1 times [2019-12-18 15:11:56,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:11:56,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44921616] [2019-12-18 15:11:56,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:11:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:11:56,673 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-18 15:11:56,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44921616] [2019-12-18 15:11:56,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:11:56,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:11:56,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489005087] [2019-12-18 15:11:56,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:11:56,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:11:56,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:11:56,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:11:56,702 INFO L87 Difference]: Start difference. First operand 14042 states. Second operand 3 states. [2019-12-18 15:11:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:11:57,103 INFO L93 Difference]: Finished difference Result 13722 states and 52554 transitions. [2019-12-18 15:11:57,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:11:57,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 15:11:57,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:11:57,244 INFO L225 Difference]: With dead ends: 13722 [2019-12-18 15:11:57,245 INFO L226 Difference]: Without dead ends: 12214 [2019-12-18 15:11:57,246 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-18 15:11:57,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12214 states. [2019-12-18 15:11:57,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12214 to 12214. [2019-12-18 15:11:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12214 states. [2019-12-18 15:11:57,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12214 states to 12214 states and 46640 transitions. [2019-12-18 15:11:57,944 INFO L78 Accepts]: Start accepts. Automaton has 12214 states and 46640 transitions. Word has length 7 [2019-12-18 15:11:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:11:57,945 INFO L462 AbstractCegarLoop]: Abstraction has 12214 states and 46640 transitions. [2019-12-18 15:11:57,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:11:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 12214 states and 46640 transitions. [2019-12-18 15:11:57,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 15:11:57,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:11:57,951 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:11:57,951 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:11:57,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:11:57,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1356084764, now seen corresponding path program 1 times [2019-12-18 15:11:57,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:11:57,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047303151] [2019-12-18 15:11:57,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:11:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:11:58,137 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-18 15:11:58,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047303151] [2019-12-18 15:11:58,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:11:58,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:11:58,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448694793] [2019-12-18 15:11:58,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 15:11:58,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:11:58,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 15:11:58,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 15:11:58,142 INFO L87 Difference]: Start difference. First operand 12214 states and 46640 transitions. Second operand 4 states. [2019-12-18 15:11:59,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:11:59,591 INFO L93 Difference]: Finished difference Result 18446 states and 67942 transitions. [2019-12-18 15:11:59,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:11:59,591 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 15:11:59,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:11:59,728 INFO L225 Difference]: With dead ends: 18446 [2019-12-18 15:11:59,728 INFO L226 Difference]: Without dead ends: 18390 [2019-12-18 15:11:59,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:11:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18390 states. [2019-12-18 15:12:00,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18390 to 16710. [2019-12-18 15:12:00,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16710 states. [2019-12-18 15:12:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16710 states to 16710 states and 62402 transitions. [2019-12-18 15:12:00,504 INFO L78 Accepts]: Start accepts. Automaton has 16710 states and 62402 transitions. Word has length 13 [2019-12-18 15:12:00,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:00,504 INFO L462 AbstractCegarLoop]: Abstraction has 16710 states and 62402 transitions. [2019-12-18 15:12:00,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 15:12:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 16710 states and 62402 transitions. [2019-12-18 15:12:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 15:12:00,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:00,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:00,515 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:00,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash -280168635, now seen corresponding path program 1 times [2019-12-18 15:12:00,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:00,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697362751] [2019-12-18 15:12:00,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:00,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:00,690 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-18 15:12:00,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697362751] [2019-12-18 15:12:00,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:00,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:12:00,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433759725] [2019-12-18 15:12:00,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:12:00,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:00,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:12:00,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:12:00,692 INFO L87 Difference]: Start difference. First operand 16710 states and 62402 transitions. Second operand 5 states. [2019-12-18 15:12:01,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:01,077 INFO L93 Difference]: Finished difference Result 24000 states and 87901 transitions. [2019-12-18 15:12:01,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 15:12:01,078 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 15:12:01,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:01,192 INFO L225 Difference]: With dead ends: 24000 [2019-12-18 15:12:01,192 INFO L226 Difference]: Without dead ends: 23924 [2019-12-18 15:12:01,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:12:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-18 15:12:02,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20292. [2019-12-18 15:12:02,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20292 states. [2019-12-18 15:12:02,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20292 states to 20292 states and 75385 transitions. [2019-12-18 15:12:02,089 INFO L78 Accepts]: Start accepts. Automaton has 20292 states and 75385 transitions. Word has length 16 [2019-12-18 15:12:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:02,089 INFO L462 AbstractCegarLoop]: Abstraction has 20292 states and 75385 transitions. [2019-12-18 15:12:02,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:12:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 20292 states and 75385 transitions. [2019-12-18 15:12:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 15:12:02,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:02,100 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:02,101 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1749985236, now seen corresponding path program 1 times [2019-12-18 15:12:02,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:02,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54073133] [2019-12-18 15:12:02,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:02,149 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-18 15:12:02,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54073133] [2019-12-18 15:12:02,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:02,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 15:12:02,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021182826] [2019-12-18 15:12:02,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:02,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:02,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:02,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:02,153 INFO L87 Difference]: Start difference. First operand 20292 states and 75385 transitions. Second operand 3 states. [2019-12-18 15:12:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:02,277 INFO L93 Difference]: Finished difference Result 20167 states and 74853 transitions. [2019-12-18 15:12:02,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:02,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 15:12:02,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:02,363 INFO L225 Difference]: With dead ends: 20167 [2019-12-18 15:12:02,363 INFO L226 Difference]: Without dead ends: 20167 [2019-12-18 15:12:02,364 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-18 15:12:02,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20167 states. [2019-12-18 15:12:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20167 to 20167. [2019-12-18 15:12:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20167 states. [2019-12-18 15:12:04,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20167 states to 20167 states and 74853 transitions. [2019-12-18 15:12:04,011 INFO L78 Accepts]: Start accepts. Automaton has 20167 states and 74853 transitions. Word has length 18 [2019-12-18 15:12:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:04,012 INFO L462 AbstractCegarLoop]: Abstraction has 20167 states and 74853 transitions. [2019-12-18 15:12:04,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:04,012 INFO L276 IsEmpty]: Start isEmpty. Operand 20167 states and 74853 transitions. [2019-12-18 15:12:04,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:12:04,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:04,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:04,023 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:04,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:04,023 INFO L82 PathProgramCache]: Analyzing trace with hash -292292173, now seen corresponding path program 1 times [2019-12-18 15:12:04,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:04,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479368455] [2019-12-18 15:12:04,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:04,111 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-18 15:12:04,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479368455] [2019-12-18 15:12:04,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:04,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:12:04,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131748145] [2019-12-18 15:12:04,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:04,115 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:04,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:04,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:04,115 INFO L87 Difference]: Start difference. First operand 20167 states and 74853 transitions. Second operand 3 states. [2019-12-18 15:12:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:04,227 INFO L93 Difference]: Finished difference Result 19155 states and 70209 transitions. [2019-12-18 15:12:04,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:04,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-18 15:12:04,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:04,281 INFO L225 Difference]: With dead ends: 19155 [2019-12-18 15:12:04,281 INFO L226 Difference]: Without dead ends: 19155 [2019-12-18 15:12:04,281 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-18 15:12:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19155 states. [2019-12-18 15:12:04,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19155 to 18891. [2019-12-18 15:12:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18891 states. [2019-12-18 15:12:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18891 states to 18891 states and 69309 transitions. [2019-12-18 15:12:05,038 INFO L78 Accepts]: Start accepts. Automaton has 18891 states and 69309 transitions. Word has length 19 [2019-12-18 15:12:05,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:05,038 INFO L462 AbstractCegarLoop]: Abstraction has 18891 states and 69309 transitions. [2019-12-18 15:12:05,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 18891 states and 69309 transitions. [2019-12-18 15:12:05,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 15:12:05,045 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:05,045 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:05,046 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:05,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:05,046 INFO L82 PathProgramCache]: Analyzing trace with hash 44045431, now seen corresponding path program 1 times [2019-12-18 15:12:05,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:05,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971399246] [2019-12-18 15:12:05,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:05,117 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-18 15:12:05,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971399246] [2019-12-18 15:12:05,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:05,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 15:12:05,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191870472] [2019-12-18 15:12:05,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 15:12:05,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:05,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 15:12:05,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 15:12:05,120 INFO L87 Difference]: Start difference. First operand 18891 states and 69309 transitions. Second operand 5 states. [2019-12-18 15:12:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:05,211 INFO L93 Difference]: Finished difference Result 3080 states and 9315 transitions. [2019-12-18 15:12:05,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 15:12:05,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 15:12:05,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:05,214 INFO L225 Difference]: With dead ends: 3080 [2019-12-18 15:12:05,215 INFO L226 Difference]: Without dead ends: 2014 [2019-12-18 15:12:05,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:12:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2019-12-18 15:12:05,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 2014. [2019-12-18 15:12:05,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2014 states. [2019-12-18 15:12:05,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 5324 transitions. [2019-12-18 15:12:05,252 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 5324 transitions. Word has length 19 [2019-12-18 15:12:05,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:05,253 INFO L462 AbstractCegarLoop]: Abstraction has 2014 states and 5324 transitions. [2019-12-18 15:12:05,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 15:12:05,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 5324 transitions. [2019-12-18 15:12:05,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:12:05,256 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:05,256 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:05,256 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:05,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:05,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1434647427, now seen corresponding path program 1 times [2019-12-18 15:12:05,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:05,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130983449] [2019-12-18 15:12:05,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:05,314 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-18 15:12:05,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130983449] [2019-12-18 15:12:05,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:05,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:12:05,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382167768] [2019-12-18 15:12:05,315 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:05,315 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:05,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:05,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:05,316 INFO L87 Difference]: Start difference. First operand 2014 states and 5324 transitions. Second operand 3 states. [2019-12-18 15:12:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:05,376 INFO L93 Difference]: Finished difference Result 2850 states and 7274 transitions. [2019-12-18 15:12:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:05,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-18 15:12:05,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:05,380 INFO L225 Difference]: With dead ends: 2850 [2019-12-18 15:12:05,380 INFO L226 Difference]: Without dead ends: 2850 [2019-12-18 15:12:05,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:05,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2850 states. [2019-12-18 15:12:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2850 to 2110. [2019-12-18 15:12:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-12-18 15:12:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 5466 transitions. [2019-12-18 15:12:05,420 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 5466 transitions. Word has length 29 [2019-12-18 15:12:05,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:05,421 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 5466 transitions. [2019-12-18 15:12:05,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 5466 transitions. [2019-12-18 15:12:05,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 15:12:05,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:05,425 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:05,425 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:05,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:05,425 INFO L82 PathProgramCache]: Analyzing trace with hash 364652847, now seen corresponding path program 1 times [2019-12-18 15:12:05,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:05,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047823793] [2019-12-18 15:12:05,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:05,516 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-18 15:12:05,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047823793] [2019-12-18 15:12:05,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:05,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 15:12:05,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871504042] [2019-12-18 15:12:05,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 15:12:05,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:05,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 15:12:05,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 15:12:05,519 INFO L87 Difference]: Start difference. First operand 2110 states and 5466 transitions. Second operand 6 states. [2019-12-18 15:12:05,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:05,611 INFO L93 Difference]: Finished difference Result 1348 states and 3614 transitions. [2019-12-18 15:12:05,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 15:12:05,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 15:12:05,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:05,615 INFO L225 Difference]: With dead ends: 1348 [2019-12-18 15:12:05,615 INFO L226 Difference]: Without dead ends: 1276 [2019-12-18 15:12:05,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 15:12:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2019-12-18 15:12:05,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1276. [2019-12-18 15:12:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1276 states. [2019-12-18 15:12:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 3443 transitions. [2019-12-18 15:12:05,644 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 3443 transitions. Word has length 29 [2019-12-18 15:12:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:05,644 INFO L462 AbstractCegarLoop]: Abstraction has 1276 states and 3443 transitions. [2019-12-18 15:12:05,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 15:12:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 3443 transitions. [2019-12-18 15:12:05,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:12:05,648 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:05,649 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:05,649 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:05,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:05,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1812124980, now seen corresponding path program 1 times [2019-12-18 15:12:05,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:05,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544116024] [2019-12-18 15:12:05,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:05,689 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-18 15:12:05,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544116024] [2019-12-18 15:12:05,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:05,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 15:12:05,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651138970] [2019-12-18 15:12:05,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:05,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:05,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:05,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:05,691 INFO L87 Difference]: Start difference. First operand 1276 states and 3443 transitions. Second operand 3 states. [2019-12-18 15:12:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:05,730 INFO L93 Difference]: Finished difference Result 1496 states and 3891 transitions. [2019-12-18 15:12:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:05,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-18 15:12:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:05,733 INFO L225 Difference]: With dead ends: 1496 [2019-12-18 15:12:05,734 INFO L226 Difference]: Without dead ends: 1496 [2019-12-18 15:12:05,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:05,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2019-12-18 15:12:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1328. [2019-12-18 15:12:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1328 states. [2019-12-18 15:12:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1328 states to 1328 states and 3495 transitions. [2019-12-18 15:12:05,756 INFO L78 Accepts]: Start accepts. Automaton has 1328 states and 3495 transitions. Word has length 45 [2019-12-18 15:12:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:05,756 INFO L462 AbstractCegarLoop]: Abstraction has 1328 states and 3495 transitions. [2019-12-18 15:12:05,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1328 states and 3495 transitions. [2019-12-18 15:12:05,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:12:05,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:05,760 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:05,760 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:05,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:05,760 INFO L82 PathProgramCache]: Analyzing trace with hash -24959066, now seen corresponding path program 1 times [2019-12-18 15:12:05,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:05,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706792790] [2019-12-18 15:12:05,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:05,818 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-18 15:12:05,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706792790] [2019-12-18 15:12:05,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:05,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 15:12:05,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361245952] [2019-12-18 15:12:05,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 15:12:05,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:05,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 15:12:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 15:12:05,821 INFO L87 Difference]: Start difference. First operand 1328 states and 3495 transitions. Second operand 3 states. [2019-12-18 15:12:05,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:05,835 INFO L93 Difference]: Finished difference Result 1865 states and 4650 transitions. [2019-12-18 15:12:05,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 15:12:05,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-12-18 15:12:05,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:05,838 INFO L225 Difference]: With dead ends: 1865 [2019-12-18 15:12:05,838 INFO L226 Difference]: Without dead ends: 1192 [2019-12-18 15:12:05,838 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-18 15:12:05,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2019-12-18 15:12:05,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 1192. [2019-12-18 15:12:05,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1192 states. [2019-12-18 15:12:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 3078 transitions. [2019-12-18 15:12:05,857 INFO L78 Accepts]: Start accepts. Automaton has 1192 states and 3078 transitions. Word has length 45 [2019-12-18 15:12:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:05,857 INFO L462 AbstractCegarLoop]: Abstraction has 1192 states and 3078 transitions. [2019-12-18 15:12:05,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 15:12:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1192 states and 3078 transitions. [2019-12-18 15:12:05,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:12:05,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:05,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:05,861 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash -928078620, now seen corresponding path program 2 times [2019-12-18 15:12:05,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:05,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122366653] [2019-12-18 15:12:05,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:05,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 15:12:05,968 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-18 15:12:05,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122366653] [2019-12-18 15:12:05,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 15:12:05,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 15:12:05,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680576657] [2019-12-18 15:12:05,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 15:12:05,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 15:12:05,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 15:12:05,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 15:12:05,971 INFO L87 Difference]: Start difference. First operand 1192 states and 3078 transitions. Second operand 7 states. [2019-12-18 15:12:06,166 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-18 15:12:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 15:12:06,338 INFO L93 Difference]: Finished difference Result 3208 states and 8220 transitions. [2019-12-18 15:12:06,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 15:12:06,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-12-18 15:12:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 15:12:06,343 INFO L225 Difference]: With dead ends: 3208 [2019-12-18 15:12:06,343 INFO L226 Difference]: Without dead ends: 2140 [2019-12-18 15:12:06,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 15:12:06,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2140 states. [2019-12-18 15:12:06,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2140 to 1336. [2019-12-18 15:12:06,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-12-18 15:12:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 3428 transitions. [2019-12-18 15:12:06,371 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 3428 transitions. Word has length 45 [2019-12-18 15:12:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 15:12:06,371 INFO L462 AbstractCegarLoop]: Abstraction has 1336 states and 3428 transitions. [2019-12-18 15:12:06,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 15:12:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 3428 transitions. [2019-12-18 15:12:06,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 15:12:06,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 15:12:06,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 15:12:06,376 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 15:12:06,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 15:12:06,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1267873360, now seen corresponding path program 3 times [2019-12-18 15:12:06,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 15:12:06,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962808556] [2019-12-18 15:12:06,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 15:12:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:12:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 15:12:06,551 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 15:12:06,551 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 15:12:06,555 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] ULTIMATE.startENTRY-->L814: Formula: (let ((.cse0 (store |v_#valid_68| 0 0))) (and (= v_~y$w_buff1_used~0_392 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y~0_142 0) (= v_~y$r_buff1_thd0~0_186 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_31| 1) |v_#valid_66|) (= |v_#NULL.offset_6| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_31| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2577~0.base_31|) |v_ULTIMATE.start_main_~#t2577~0.offset_22| 0)) |v_#memory_int_23|) (= v_~z~0_143 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2577~0.base_31|) 0) (= v_~weak$$choice2~0_148 0) (= 0 v_~y$flush_delayed~0_39) (= v_~y$w_buff0_used~0_626 0) (= v_~main$tmp_guard1~0_45 0) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 0 v_~__unbuffered_p1_EAX~0_72) (= v_~y$w_buff1~0_220 0) (= v_~y$r_buff1_thd1~0_109 0) (= v_~y$mem_tmp~0_18 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~y$r_buff0_thd2~0_297) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2577~0.base_31|) (= 0 v_~y$w_buff0~0_290) (= 0 |v_#NULL.base_6|) (= v_~y$read_delayed~0_5 0) (= 0 v_~y$read_delayed_var~0.base_7) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t2577~0.base_31| 4)) (= 0 v_~y$r_buff0_thd3~0_185) (= v_~y$r_buff0_thd0~0_93 0) (= 0 |v_ULTIMATE.start_main_~#t2577~0.offset_22|) (= 0 v_~y$r_buff1_thd3~0_159) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_77) (= 0 v_~y$r_buff1_thd2~0_283) (= v_~x~0_19 0) (= v_~y$r_buff0_thd1~0_25 0) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_68|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_10|, ULTIMATE.start_main_#t~nondet34=|v_ULTIMATE.start_main_#t~nondet34_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_22|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_159, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_72, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_25, ~y$flush_delayed~0=v_~y$flush_delayed~0_39, ULTIMATE.start_main_~#t2577~0.base=|v_ULTIMATE.start_main_~#t2577~0.base_31|, #length=|v_#length_25|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_29|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_92|, ~y$w_buff1~0=v_~y$w_buff1~0_220, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_297, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_31|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_186, ~x~0=v_~x~0_19, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_15|, ~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_626, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_45, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_109, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_23|, ~y$w_buff0~0=v_~y$w_buff0~0_290, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_185, ~y~0=v_~y~0_142, ULTIMATE.start_main_~#t2577~0.offset=|v_ULTIMATE.start_main_~#t2577~0.offset_22|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_32|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_107|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_283, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_32|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_93, #valid=|v_#valid_66|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_143, ~weak$$choice2~0=v_~weak$$choice2~0_148, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_392} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t2579~0.offset, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_#t~nondet34, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t2578~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ULTIMATE.start_main_~#t2579~0.base, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t2577~0.base, #length, ~y~0, ULTIMATE.start_main_~#t2577~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_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, ~y$r_buff0_thd2~0, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2578~0.base, ~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-18 15:12:06,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L814-1-->L816: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2578~0.base_10|) |v_ULTIMATE.start_main_~#t2578~0.offset_9| 1)) |v_#memory_int_11|) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2578~0.base_10| 4) |v_#length_13|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10| 1)) (= 0 |v_ULTIMATE.start_main_~#t2578~0.offset_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2578~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2578~0.offset=|v_ULTIMATE.start_main_~#t2578~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2578~0.base=|v_ULTIMATE.start_main_~#t2578~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2578~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2578~0.base] because there is no mapped edge [2019-12-18 15:12:06,557 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L816-1-->L818: Formula: (and (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t2579~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2579~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2579~0.base_11|) |v_ULTIMATE.start_main_~#t2579~0.offset_10| 2)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t2579~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t2579~0.base_11| 0)) (= (select |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11|) 0) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t2579~0.base_11| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2579~0.base=|v_ULTIMATE.start_main_~#t2579~0.base_11|, ULTIMATE.start_main_~#t2579~0.offset=|v_ULTIMATE.start_main_~#t2579~0.offset_10|, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_4|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2579~0.base, ULTIMATE.start_main_~#t2579~0.offset, ULTIMATE.start_main_#t~nondet33, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 15:12:06,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [620] [620] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_113 1) (= 0 (mod v_~y$w_buff1_used~0_71 256)) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_33) (= 1 v_~y$w_buff0~0_40) (= |v_P2Thread1of1ForFork2_#in~arg.base_16| v_P2Thread1of1ForFork2_~arg.base_16) (= v_P2Thread1of1ForFork2_~arg.offset_16 |v_P2Thread1of1ForFork2_#in~arg.offset_16|) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18) (= |v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16| 1) (= v_~y$w_buff1_used~0_71 v_~y$w_buff0_used~0_114)) InVars {P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|} OutVars{P2Thread1of1ForFork2_#in~arg.offset=|v_P2Thread1of1ForFork2_#in~arg.offset_16|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_113, ~y$w_buff1~0=v_~y$w_buff1~0_33, P2Thread1of1ForFork2_~arg.base=v_P2Thread1of1ForFork2_~arg.base_16, P2Thread1of1ForFork2_~arg.offset=v_P2Thread1of1ForFork2_~arg.offset_16, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork2___VERIFIER_assert_#in~expression_16|, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork2___VERIFIER_assert_~expression=v_P2Thread1of1ForFork2___VERIFIER_assert_~expression_18, P2Thread1of1ForFork2_#in~arg.base=|v_P2Thread1of1ForFork2_#in~arg.base_16|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_71} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork2_~arg.base, P2Thread1of1ForFork2_~arg.offset, P2Thread1of1ForFork2___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork2___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 15:12:06,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [697] [697] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_10 |v_P0Thread1of1ForFork0_#in~arg.base_10|) (= v_~z~0_85 2) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_10 |v_P0Thread1of1ForFork0_#in~arg.offset_10|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, ~x~0=v_~x~0_14} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_10|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z~0=v_~z~0_85, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_10, ~x~0=v_~x~0_14, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_10} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 15:12:06,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L756-->L756-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-107141987 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite8_Out-107141987| |P1Thread1of1ForFork1_#t~ite9_Out-107141987|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-107141987 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-107141987 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-107141987 256)) (and (= 0 (mod ~y$w_buff1_used~0_In-107141987 256)) .cse1))) (= ~y$w_buff0~0_In-107141987 |P1Thread1of1ForFork1_#t~ite8_Out-107141987|)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite8_In-107141987| |P1Thread1of1ForFork1_#t~ite8_Out-107141987|) (= ~y$w_buff0~0_In-107141987 |P1Thread1of1ForFork1_#t~ite9_Out-107141987|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-107141987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-107141987, ~y$w_buff0~0=~y$w_buff0~0_In-107141987, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-107141987, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_In-107141987|, ~weak$$choice2~0=~weak$$choice2~0_In-107141987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-107141987} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-107141987, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-107141987, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-107141987|, ~y$w_buff0~0=~y$w_buff0~0_In-107141987, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-107141987, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out-107141987|, ~weak$$choice2~0=~weak$$choice2~0_In-107141987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-107141987} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-18 15:12:06,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L758-->L758-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1735944511 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite15_Out-1735944511| |P1Thread1of1ForFork1_#t~ite14_Out-1735944511|) (= ~y$w_buff0_used~0_In-1735944511 |P1Thread1of1ForFork1_#t~ite14_Out-1735944511|) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1735944511 256)))) (or (= (mod ~y$w_buff0_used~0_In-1735944511 256) 0) (and (= 0 (mod ~y$w_buff1_used~0_In-1735944511 256)) .cse0) (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1735944511 256))))) .cse1) (and (not .cse1) (= |P1Thread1of1ForFork1_#t~ite14_In-1735944511| |P1Thread1of1ForFork1_#t~ite14_Out-1735944511|) (= ~y$w_buff0_used~0_In-1735944511 |P1Thread1of1ForFork1_#t~ite15_Out-1735944511|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1735944511, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1735944511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1735944511, ~weak$$choice2~0=~weak$$choice2~0_In-1735944511, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_In-1735944511|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1735944511} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1735944511, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1735944511, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1735944511, P1Thread1of1ForFork1_#t~ite15=|P1Thread1of1ForFork1_#t~ite15_Out-1735944511|, ~weak$$choice2~0=~weak$$choice2~0_In-1735944511, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-1735944511|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1735944511} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite15, P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 15:12:06,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [625] [625] L760-->L761: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd2~0_59 v_~y$r_buff0_thd2~0_58)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_59, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{P1Thread1of1ForFork1_#t~ite19=|v_P1Thread1of1ForFork1_#t~ite19_16|, P1Thread1of1ForFork1_#t~ite20=|v_P1Thread1of1ForFork1_#t~ite20_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_58, P1Thread1of1ForFork1_#t~ite21=|v_P1Thread1of1ForFork1_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite19, P1Thread1of1ForFork1_#t~ite20, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 15:12:06,570 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1183034056 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1183034056 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite28_Out1183034056| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In1183034056 |P2Thread1of1ForFork2_#t~ite28_Out1183034056|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1183034056, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1183034056} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1183034056, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1183034056, P2Thread1of1ForFork2_#t~ite28=|P2Thread1of1ForFork2_#t~ite28_Out1183034056|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-18 15:12:06,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L763-->L771: Formula: (and (= v_~y~0_31 v_~y$mem_tmp~0_5) (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= 0 v_~y$flush_delayed~0_7) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-18 15:12:06,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [666] [666] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-249463528 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-249463528 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-249463528 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd3~0_In-249463528 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite29_Out-249463528| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite29_Out-249463528| ~y$w_buff1_used~0_In-249463528) (or .cse3 .cse2)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-249463528, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-249463528, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-249463528, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-249463528} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-249463528, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-249463528, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-249463528, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out-249463528|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-249463528} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 15:12:06,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L794-->L795: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1765659673 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-1765659673 256)))) (or (and (= ~y$r_buff0_thd3~0_In-1765659673 ~y$r_buff0_thd3~0_Out-1765659673) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd3~0_Out-1765659673) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1765659673, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1765659673} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1765659673, P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out-1765659673|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1765659673} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 15:12:06,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L795-->L795-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In2055954113 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2055954113 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In2055954113 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In2055954113 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite31_Out2055954113| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite31_Out2055954113| ~y$r_buff1_thd3~0_In2055954113)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2055954113, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2055954113, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2055954113, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2055954113} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In2055954113, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2055954113, P2Thread1of1ForFork2_#t~ite31=|P2Thread1of1ForFork2_#t~ite31_Out2055954113|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In2055954113, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2055954113} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31] because there is no mapped edge [2019-12-18 15:12:06,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L795-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite31_38| v_~y$r_buff1_thd3~0_108) (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_108, P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_37|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 15:12:06,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L822-->L824-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_32 256)) (= (mod v_~y$w_buff0_used~0_137 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_137, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 15:12:06,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L824-2-->L824-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In802906744 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In802906744 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite35_Out802906744| ~y$w_buff1~0_In802906744)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite35_Out802906744| ~y~0_In802906744)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In802906744, ~y~0=~y~0_In802906744, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In802906744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In802906744} OutVars{~y$w_buff1~0=~y$w_buff1~0_In802906744, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out802906744|, ~y~0=~y~0_In802906744, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In802906744, ~y$w_buff1_used~0=~y$w_buff1_used~0_In802906744} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35] because there is no mapped edge [2019-12-18 15:12:06,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L824-4-->L825: Formula: (= v_~y~0_22 |v_ULTIMATE.start_main_#t~ite35_10|) InVars {ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_10|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_13|, ~y~0=v_~y~0_22} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~y~0] because there is no mapped edge [2019-12-18 15:12:06,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [670] [670] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-1538476452 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1538476452 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite37_Out-1538476452|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1538476452 |ULTIMATE.start_main_#t~ite37_Out-1538476452|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1538476452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1538476452} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1538476452, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1538476452, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out-1538476452|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 15:12:06,576 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L826-->L826-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-2007129553 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-2007129553 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-2007129553 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-2007129553 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-2007129553| ~y$w_buff1_used~0_In-2007129553) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite38_Out-2007129553| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2007129553, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2007129553, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2007129553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2007129553} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2007129553, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2007129553, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-2007129553|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2007129553, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2007129553} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 15:12:06,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L827-->L827-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1534556825 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1534556825 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In1534556825 |ULTIMATE.start_main_#t~ite39_Out1534556825|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite39_Out1534556825| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1534556825, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1534556825} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1534556825, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1534556825|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1534556825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 15:12:06,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In2124650357 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2124650357 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In2124650357 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In2124650357 256)))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out2124650357| ~y$r_buff1_thd0~0_In2124650357) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite40_Out2124650357| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2124650357, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2124650357, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2124650357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124650357} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out2124650357|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2124650357, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2124650357, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2124650357, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2124650357} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 15:12:06,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L828-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_17 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 0 v_~__unbuffered_p1_EAX~0_49) (= 0 v_~__unbuffered_p0_EAX~0_23) (= v_~z~0_99 2) (= v_~y$r_buff1_thd0~0_128 |v_ULTIMATE.start_main_#t~ite40_47|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~z~0=v_~z~0_99} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_46|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_49, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z~0=v_~z~0_99, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_128, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite40, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 15:12:06,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 03:12:06 BasicIcfg [2019-12-18 15:12:06,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 15:12:06,669 INFO L168 Benchmark]: Toolchain (without parser) took 18482.59 ms. Allocated memory was 139.5 MB in the beginning and 989.9 MB in the end (delta: 850.4 MB). Free memory was 103.2 MB in the beginning and 664.9 MB in the end (delta: -561.7 MB). Peak memory consumption was 288.7 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:06,670 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 15:12:06,673 INFO L168 Benchmark]: CACSL2BoogieTranslator took 791.58 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.8 MB in the beginning and 157.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:06,674 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.20 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:06,675 INFO L168 Benchmark]: Boogie Preprocessor took 42.94 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:06,675 INFO L168 Benchmark]: RCFGBuilder took 799.49 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 109.1 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:06,676 INFO L168 Benchmark]: TraceAbstraction took 16781.63 ms. Allocated memory was 202.9 MB in the beginning and 989.9 MB in the end (delta: 787.0 MB). Free memory was 109.1 MB in the beginning and 664.9 MB in the end (delta: -555.8 MB). Peak memory consumption was 231.2 MB. Max. memory is 7.1 GB. [2019-12-18 15:12:06,685 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.50 ms. Allocated memory is still 139.5 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 791.58 ms. Allocated memory was 139.5 MB in the beginning and 202.9 MB in the end (delta: 63.4 MB). Free memory was 102.8 MB in the beginning and 157.2 MB in the end (delta: -54.4 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.20 ms. Allocated memory is still 202.9 MB. Free memory was 157.2 MB in the beginning and 154.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.94 ms. Allocated memory is still 202.9 MB. Free memory was 154.6 MB in the beginning and 152.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 799.49 ms. Allocated memory is still 202.9 MB. Free memory was 152.6 MB in the beginning and 109.1 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16781.63 ms. Allocated memory was 202.9 MB in the beginning and 989.9 MB in the end (delta: 787.0 MB). Free memory was 109.1 MB in the beginning and 664.9 MB in the end (delta: -555.8 MB). Peak memory consumption was 231.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 151 ProgramPointsBefore, 73 ProgramPointsAfterwards, 176 TransitionsBefore, 82 TransitionsAfterwards, 11400 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 20 ChoiceCompositions, 4974 VarBasedMoverChecksPositive, 245 VarBasedMoverChecksNegative, 129 SemBasedMoverChecksPositive, 162 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 63936 CheckedPairsTotal, 113 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L814] FCALL, FORK 0 pthread_create(&t2577, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2578, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t2579, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 [L788] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 2 x = 1 [L751] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L752] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L753] 2 y$flush_delayed = weak$$choice2 [L754] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L755] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L761] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] 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 [L827] 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 4 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 16.4s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1187 SDtfs, 1270 SDslu, 1986 SDs, 0 SdLazy, 564 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20292occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 11 MinimizatonAttempts, 7288 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 274 ConstructedInterpolants, 0 QuantifiedInterpolants, 25616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...