/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix011_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:00:38,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:00:38,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:00:38,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:00:38,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:00:38,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:00:38,026 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:00:38,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:00:38,030 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:00:38,031 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:00:38,032 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:00:38,033 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:00:38,033 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:00:38,034 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:00:38,035 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:00:38,036 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:00:38,037 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:00:38,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:00:38,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:00:38,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:00:38,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:00:38,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:00:38,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:00:38,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:00:38,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:00:38,049 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:00:38,049 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:00:38,050 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:00:38,050 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:00:38,051 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:00:38,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:00:38,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:00:38,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:00:38,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:00:38,055 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:00:38,055 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:00:38,056 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:00:38,056 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:00:38,056 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:00:38,057 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:00:38,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:00:38,058 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 20:00:38,074 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:00:38,074 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:00:38,075 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:00:38,075 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:00:38,076 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:00:38,076 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:00:38,076 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:00:38,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:00:38,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:00:38,077 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:00:38,077 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:00:38,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:00:38,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:00:38,077 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:00:38,078 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:00:38,078 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:00:38,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:00:38,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:00:38,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:00:38,079 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:00:38,079 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:00:38,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:00:38,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:00:38,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:00:38,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:00:38,080 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:00:38,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:00:38,080 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:00:38,080 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:00:38,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:00:38,081 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:00:38,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:00:38,358 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:00:38,371 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:00:38,374 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:00:38,376 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:00:38,376 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:00:38,377 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix011_power.opt.i [2019-12-27 20:00:38,456 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc7bd7ca/18935ff4126048679590d2c154298f74/FLAG9010599c1 [2019-12-27 20:00:39,052 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:00:39,052 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix011_power.opt.i [2019-12-27 20:00:39,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc7bd7ca/18935ff4126048679590d2c154298f74/FLAG9010599c1 [2019-12-27 20:00:39,287 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afc7bd7ca/18935ff4126048679590d2c154298f74 [2019-12-27 20:00:39,295 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:00:39,297 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:00:39,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:00:39,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:00:39,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:00:39,303 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:00:39" (1/1) ... [2019-12-27 20:00:39,306 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76182f5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:39, skipping insertion in model container [2019-12-27 20:00:39,306 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:00:39" (1/1) ... [2019-12-27 20:00:39,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:00:39,368 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:00:39,911 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:00:39,923 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:00:39,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:00:40,085 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:00:40,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40 WrapperNode [2019-12-27 20:00:40,087 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:00:40,087 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:00:40,087 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:00:40,088 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:00:40,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:00:40,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:00:40,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:00:40,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:00:40,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... [2019-12-27 20:00:40,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:00:40,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:00:40,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:00:40,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:00:40,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:00:40,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:00:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:00:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:00:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:00:40,280 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:00:40,280 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:00:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:00:40,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:00:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 20:00:40,281 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 20:00:40,281 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:00:40,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:00:40,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:00:40,284 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 20:00:41,167 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:00:41,168 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:00:41,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:00:41 BoogieIcfgContainer [2019-12-27 20:00:41,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:00:41,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:00:41,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:00:41,176 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:00:41,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:00:39" (1/3) ... [2019-12-27 20:00:41,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e68c497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:00:41, skipping insertion in model container [2019-12-27 20:00:41,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:00:40" (2/3) ... [2019-12-27 20:00:41,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e68c497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:00:41, skipping insertion in model container [2019-12-27 20:00:41,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:00:41" (3/3) ... [2019-12-27 20:00:41,184 INFO L109 eAbstractionObserver]: Analyzing ICFG mix011_power.opt.i [2019-12-27 20:00:41,195 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:00:41,196 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:00:41,208 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:00:41,209 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:00:41,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,280 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,280 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,281 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,287 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,295 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,296 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,297 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,298 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,299 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,300 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,301 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,302 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,303 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,304 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,304 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,305 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,305 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,305 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,305 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,306 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,306 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,307 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,308 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,309 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,310 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,311 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,312 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,313 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,314 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,315 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,316 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,317 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,318 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,319 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,320 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,321 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,322 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,323 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,324 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,325 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,326 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,327 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,328 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,332 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,333 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,333 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,334 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,335 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,335 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,336 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,337 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,338 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,341 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,342 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,346 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,349 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:00:41,367 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 20:00:41,388 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:00:41,388 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:00:41,388 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:00:41,389 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:00:41,389 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:00:41,389 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:00:41,389 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:00:41,389 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:00:41,407 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 242 transitions [2019-12-27 20:00:41,409 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-27 20:00:41,533 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-27 20:00:41,534 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:00:41,554 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 20:00:41,584 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 196 places, 242 transitions [2019-12-27 20:00:41,658 INFO L132 PetriNetUnfolder]: 56/239 cut-off events. [2019-12-27 20:00:41,658 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:00:41,668 INFO L76 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 239 events. 56/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 565 event pairs. 0/181 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-27 20:00:41,698 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-27 20:00:41,700 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:00:45,566 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 20:00:45,694 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 20:00:45,806 INFO L206 etLargeBlockEncoding]: Checked pairs total: 123784 [2019-12-27 20:00:45,806 INFO L214 etLargeBlockEncoding]: Total number of compositions: 125 [2019-12-27 20:00:45,810 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 127 transitions [2019-12-27 20:00:49,615 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 42982 states. [2019-12-27 20:00:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 42982 states. [2019-12-27 20:00:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 20:00:49,625 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:49,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:49,626 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:49,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:49,631 INFO L82 PathProgramCache]: Analyzing trace with hash 48878050, now seen corresponding path program 1 times [2019-12-27 20:00:49,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:49,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712883293] [2019-12-27 20:00:49,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:00:49,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712883293] [2019-12-27 20:00:49,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:49,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:00:49,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2082876203] [2019-12-27 20:00:49,918 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:49,924 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:49,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 20:00:49,941 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:49,945 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:49,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:00:49,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:49,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:00:49,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:49,963 INFO L87 Difference]: Start difference. First operand 42982 states. Second operand 3 states. [2019-12-27 20:00:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:50,929 INFO L93 Difference]: Finished difference Result 42470 states and 173504 transitions. [2019-12-27 20:00:50,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:00:50,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 20:00:50,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:51,232 INFO L225 Difference]: With dead ends: 42470 [2019-12-27 20:00:51,232 INFO L226 Difference]: Without dead ends: 39546 [2019-12-27 20:00:51,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:00:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39546 states. [2019-12-27 20:00:54,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39546 to 39546. [2019-12-27 20:00:54,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39546 states. [2019-12-27 20:00:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39546 states to 39546 states and 161440 transitions. [2019-12-27 20:00:54,834 INFO L78 Accepts]: Start accepts. Automaton has 39546 states and 161440 transitions. Word has length 7 [2019-12-27 20:00:54,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:00:54,835 INFO L462 AbstractCegarLoop]: Abstraction has 39546 states and 161440 transitions. [2019-12-27 20:00:54,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:00:54,835 INFO L276 IsEmpty]: Start isEmpty. Operand 39546 states and 161440 transitions. [2019-12-27 20:00:54,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 20:00:54,841 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:00:54,841 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:00:54,841 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:00:54,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:00:54,842 INFO L82 PathProgramCache]: Analyzing trace with hash 2064044969, now seen corresponding path program 1 times [2019-12-27 20:00:54,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:00:54,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325459094] [2019-12-27 20:00:54,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:00:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:00:54,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:00:54,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325459094] [2019-12-27 20:00:54,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:00:54,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:00:54,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [624055384] [2019-12-27 20:00:54,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:00:54,943 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:00:54,947 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 20:00:54,947 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:00:54,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:00:54,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:00:54,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:00:54,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:00:54,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:00:54,950 INFO L87 Difference]: Start difference. First operand 39546 states and 161440 transitions. Second operand 4 states. [2019-12-27 20:00:57,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:00:57,500 INFO L93 Difference]: Finished difference Result 62606 states and 245680 transitions. [2019-12-27 20:00:57,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:00:57,500 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 20:00:57,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:00:57,767 INFO L225 Difference]: With dead ends: 62606 [2019-12-27 20:00:57,768 INFO L226 Difference]: Without dead ends: 62574 [2019-12-27 20:00:57,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:00:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62574 states. [2019-12-27 20:01:00,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62574 to 60086. [2019-12-27 20:01:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60086 states. [2019-12-27 20:01:02,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60086 states to 60086 states and 237688 transitions. [2019-12-27 20:01:02,961 INFO L78 Accepts]: Start accepts. Automaton has 60086 states and 237688 transitions. Word has length 13 [2019-12-27 20:01:02,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:02,962 INFO L462 AbstractCegarLoop]: Abstraction has 60086 states and 237688 transitions. [2019-12-27 20:01:02,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:01:02,962 INFO L276 IsEmpty]: Start isEmpty. Operand 60086 states and 237688 transitions. [2019-12-27 20:01:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 20:01:02,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:02,970 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:02,970 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:02,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:02,970 INFO L82 PathProgramCache]: Analyzing trace with hash 503175658, now seen corresponding path program 1 times [2019-12-27 20:01:02,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:02,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744726728] [2019-12-27 20:01:02,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:03,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:03,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744726728] [2019-12-27 20:01:03,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:03,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:01:03,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [738313109] [2019-12-27 20:01:03,089 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:03,092 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:03,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 20:01:03,096 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:03,097 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:03,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:01:03,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:03,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:01:03,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:01:03,098 INFO L87 Difference]: Start difference. First operand 60086 states and 237688 transitions. Second operand 4 states. [2019-12-27 20:01:03,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:03,745 INFO L93 Difference]: Finished difference Result 77526 states and 302124 transitions. [2019-12-27 20:01:03,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:01:03,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 20:01:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:03,993 INFO L225 Difference]: With dead ends: 77526 [2019-12-27 20:01:03,993 INFO L226 Difference]: Without dead ends: 77496 [2019-12-27 20:01:03,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:01:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77496 states. [2019-12-27 20:01:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77496 to 68188. [2019-12-27 20:01:06,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68188 states. [2019-12-27 20:01:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68188 states to 68188 states and 268551 transitions. [2019-12-27 20:01:07,575 INFO L78 Accepts]: Start accepts. Automaton has 68188 states and 268551 transitions. Word has length 16 [2019-12-27 20:01:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:07,575 INFO L462 AbstractCegarLoop]: Abstraction has 68188 states and 268551 transitions. [2019-12-27 20:01:07,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:01:07,575 INFO L276 IsEmpty]: Start isEmpty. Operand 68188 states and 268551 transitions. [2019-12-27 20:01:07,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 20:01:07,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:07,584 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-27 20:01:07,584 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:07,585 INFO L82 PathProgramCache]: Analyzing trace with hash -787717565, now seen corresponding path program 1 times [2019-12-27 20:01:07,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:07,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434957470] [2019-12-27 20:01:07,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:07,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434957470] [2019-12-27 20:01:07,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:07,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:01:07,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1594929436] [2019-12-27 20:01:07,641 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:07,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:07,646 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 20 states and 20 transitions. [2019-12-27 20:01:07,647 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:07,647 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:07,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:07,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:07,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:07,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:07,649 INFO L87 Difference]: Start difference. First operand 68188 states and 268551 transitions. Second operand 3 states. [2019-12-27 20:01:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:07,964 INFO L93 Difference]: Finished difference Result 64048 states and 251839 transitions. [2019-12-27 20:01:07,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:07,964 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 20:01:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:08,112 INFO L225 Difference]: With dead ends: 64048 [2019-12-27 20:01:08,112 INFO L226 Difference]: Without dead ends: 63856 [2019-12-27 20:01:08,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63856 states. [2019-12-27 20:01:12,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63856 to 63856. [2019-12-27 20:01:12,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63856 states. [2019-12-27 20:01:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63856 states to 63856 states and 251151 transitions. [2019-12-27 20:01:12,676 INFO L78 Accepts]: Start accepts. Automaton has 63856 states and 251151 transitions. Word has length 18 [2019-12-27 20:01:12,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:12,676 INFO L462 AbstractCegarLoop]: Abstraction has 63856 states and 251151 transitions. [2019-12-27 20:01:12,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:12,677 INFO L276 IsEmpty]: Start isEmpty. Operand 63856 states and 251151 transitions. [2019-12-27 20:01:12,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 20:01:12,694 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:12,694 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:01:12,694 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:12,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:12,695 INFO L82 PathProgramCache]: Analyzing trace with hash -802769487, now seen corresponding path program 1 times [2019-12-27 20:01:12,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:12,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952224328] [2019-12-27 20:01:12,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:12,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:12,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952224328] [2019-12-27 20:01:12,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:12,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:01:12,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [711528274] [2019-12-27 20:01:12,780 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:12,784 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:12,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 76 transitions. [2019-12-27 20:01:12,792 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:12,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:12,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:01:12,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:01:12,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:01:12,793 INFO L87 Difference]: Start difference. First operand 63856 states and 251151 transitions. Second operand 5 states. [2019-12-27 20:01:14,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:14,203 INFO L93 Difference]: Finished difference Result 77072 states and 298885 transitions. [2019-12-27 20:01:14,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 20:01:14,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 20:01:14,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:14,393 INFO L225 Difference]: With dead ends: 77072 [2019-12-27 20:01:14,393 INFO L226 Difference]: Without dead ends: 77018 [2019-12-27 20:01:14,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:01:15,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77018 states. [2019-12-27 20:01:18,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77018 to 63662. [2019-12-27 20:01:18,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63662 states. [2019-12-27 20:01:19,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63662 states to 63662 states and 250434 transitions. [2019-12-27 20:01:19,068 INFO L78 Accepts]: Start accepts. Automaton has 63662 states and 250434 transitions. Word has length 22 [2019-12-27 20:01:19,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:19,068 INFO L462 AbstractCegarLoop]: Abstraction has 63662 states and 250434 transitions. [2019-12-27 20:01:19,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:01:19,069 INFO L276 IsEmpty]: Start isEmpty. Operand 63662 states and 250434 transitions. [2019-12-27 20:01:19,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 20:01:19,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:19,138 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] [2019-12-27 20:01:19,138 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:19,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:19,139 INFO L82 PathProgramCache]: Analyzing trace with hash -655538281, now seen corresponding path program 1 times [2019-12-27 20:01:19,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:19,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254445247] [2019-12-27 20:01:19,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:19,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:19,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:19,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254445247] [2019-12-27 20:01:19,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:19,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:01:19,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [811872337] [2019-12-27 20:01:19,234 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:19,243 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:19,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 34 transitions. [2019-12-27 20:01:19,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:19,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:01:19,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:19,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:19,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:19,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:19,255 INFO L87 Difference]: Start difference. First operand 63662 states and 250434 transitions. Second operand 3 states. [2019-12-27 20:01:19,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:19,584 INFO L93 Difference]: Finished difference Result 63610 states and 250254 transitions. [2019-12-27 20:01:19,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:19,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-27 20:01:19,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:19,731 INFO L225 Difference]: With dead ends: 63610 [2019-12-27 20:01:19,731 INFO L226 Difference]: Without dead ends: 63610 [2019-12-27 20:01:19,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:20,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63610 states. [2019-12-27 20:01:23,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63610 to 63610. [2019-12-27 20:01:23,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63610 states. [2019-12-27 20:01:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63610 states to 63610 states and 250254 transitions. [2019-12-27 20:01:23,817 INFO L78 Accepts]: Start accepts. Automaton has 63610 states and 250254 transitions. Word has length 32 [2019-12-27 20:01:23,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:23,817 INFO L462 AbstractCegarLoop]: Abstraction has 63610 states and 250254 transitions. [2019-12-27 20:01:23,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 63610 states and 250254 transitions. [2019-12-27 20:01:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 20:01:23,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:23,889 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] [2019-12-27 20:01:23,889 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:23,889 INFO L82 PathProgramCache]: Analyzing trace with hash -33493824, now seen corresponding path program 1 times [2019-12-27 20:01:23,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:23,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788903770] [2019-12-27 20:01:23,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:23,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:23,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788903770] [2019-12-27 20:01:23,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:23,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:01:23,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [471811497] [2019-12-27 20:01:23,959 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:23,966 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:23,978 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 48 transitions. [2019-12-27 20:01:23,978 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:23,985 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:01:23,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:01:23,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:23,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:01:23,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:23,987 INFO L87 Difference]: Start difference. First operand 63610 states and 250254 transitions. Second operand 3 states. [2019-12-27 20:01:24,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:24,723 INFO L93 Difference]: Finished difference Result 63610 states and 247314 transitions. [2019-12-27 20:01:24,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:01:24,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-27 20:01:24,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:24,873 INFO L225 Difference]: With dead ends: 63610 [2019-12-27 20:01:24,873 INFO L226 Difference]: Without dead ends: 63610 [2019-12-27 20:01:24,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:01:25,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63610 states. [2019-12-27 20:01:26,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63610 to 63290. [2019-12-27 20:01:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63290 states. [2019-12-27 20:01:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63290 states to 63290 states and 246226 transitions. [2019-12-27 20:01:26,972 INFO L78 Accepts]: Start accepts. Automaton has 63290 states and 246226 transitions. Word has length 33 [2019-12-27 20:01:26,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:26,972 INFO L462 AbstractCegarLoop]: Abstraction has 63290 states and 246226 transitions. [2019-12-27 20:01:26,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:01:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 63290 states and 246226 transitions. [2019-12-27 20:01:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:01:27,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:27,049 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] [2019-12-27 20:01:27,050 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:27,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:27,050 INFO L82 PathProgramCache]: Analyzing trace with hash 142914011, now seen corresponding path program 1 times [2019-12-27 20:01:27,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:27,051 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177949783] [2019-12-27 20:01:27,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:27,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:27,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177949783] [2019-12-27 20:01:27,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:27,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:01:27,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [926674863] [2019-12-27 20:01:27,144 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:27,150 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:27,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 69 states and 101 transitions. [2019-12-27 20:01:27,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:27,191 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:01:27,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 20:01:27,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:27,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 20:01:27,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:01:27,192 INFO L87 Difference]: Start difference. First operand 63290 states and 246226 transitions. Second operand 7 states. [2019-12-27 20:01:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:29,494 INFO L93 Difference]: Finished difference Result 162766 states and 632902 transitions. [2019-12-27 20:01:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 20:01:29,494 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 20:01:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:29,848 INFO L225 Difference]: With dead ends: 162766 [2019-12-27 20:01:29,848 INFO L226 Difference]: Without dead ends: 135720 [2019-12-27 20:01:29,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-27 20:01:30,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135720 states. [2019-12-27 20:01:36,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135720 to 105090. [2019-12-27 20:01:36,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105090 states. [2019-12-27 20:01:36,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105090 states to 105090 states and 412794 transitions. [2019-12-27 20:01:36,846 INFO L78 Accepts]: Start accepts. Automaton has 105090 states and 412794 transitions. Word has length 34 [2019-12-27 20:01:36,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:01:36,846 INFO L462 AbstractCegarLoop]: Abstraction has 105090 states and 412794 transitions. [2019-12-27 20:01:36,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 20:01:36,847 INFO L276 IsEmpty]: Start isEmpty. Operand 105090 states and 412794 transitions. [2019-12-27 20:01:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 20:01:36,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:01:36,988 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] [2019-12-27 20:01:36,988 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:01:36,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:01:36,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1215394357, now seen corresponding path program 2 times [2019-12-27 20:01:36,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:01:36,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372353251] [2019-12-27 20:01:36,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:01:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:01:37,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:01:37,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372353251] [2019-12-27 20:01:37,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:01:37,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:01:37,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [749606218] [2019-12-27 20:01:37,139 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:01:37,145 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:01:37,169 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 141 transitions. [2019-12-27 20:01:37,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:01:37,375 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:01:37,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-27 20:01:37,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:01:37,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-27 20:01:37,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:01:37,377 INFO L87 Difference]: Start difference. First operand 105090 states and 412794 transitions. Second operand 18 states. [2019-12-27 20:01:37,527 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-27 20:01:37,755 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2019-12-27 20:01:55,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:01:55,232 INFO L93 Difference]: Finished difference Result 670120 states and 2629789 transitions. [2019-12-27 20:01:55,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-27 20:01:55,233 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2019-12-27 20:01:55,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:01:58,145 INFO L225 Difference]: With dead ends: 670120 [2019-12-27 20:01:58,145 INFO L226 Difference]: Without dead ends: 577456 [2019-12-27 20:01:58,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=782, Invalid=3000, Unknown=0, NotChecked=0, Total=3782 [2019-12-27 20:02:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577456 states. [2019-12-27 20:02:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577456 to 147966. [2019-12-27 20:02:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147966 states. [2019-12-27 20:02:12,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147966 states to 147966 states and 587946 transitions. [2019-12-27 20:02:12,920 INFO L78 Accepts]: Start accepts. Automaton has 147966 states and 587946 transitions. Word has length 34 [2019-12-27 20:02:12,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:12,921 INFO L462 AbstractCegarLoop]: Abstraction has 147966 states and 587946 transitions. [2019-12-27 20:02:12,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-27 20:02:12,921 INFO L276 IsEmpty]: Start isEmpty. Operand 147966 states and 587946 transitions. [2019-12-27 20:02:13,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 20:02:13,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:13,174 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] [2019-12-27 20:02:13,174 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:13,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:13,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2146150024, now seen corresponding path program 1 times [2019-12-27 20:02:13,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:13,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203910581] [2019-12-27 20:02:13,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:13,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:13,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:13,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203910581] [2019-12-27 20:02:13,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:13,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:13,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [186103476] [2019-12-27 20:02:13,245 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:13,251 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:13,281 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 106 states and 173 transitions. [2019-12-27 20:02:13,281 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:13,300 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:02:13,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:02:13,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:13,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:02:13,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:13,301 INFO L87 Difference]: Start difference. First operand 147966 states and 587946 transitions. Second operand 5 states. [2019-12-27 20:02:15,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:15,014 INFO L93 Difference]: Finished difference Result 129118 states and 453546 transitions. [2019-12-27 20:02:15,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 20:02:15,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-27 20:02:15,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:15,285 INFO L225 Difference]: With dead ends: 129118 [2019-12-27 20:02:15,285 INFO L226 Difference]: Without dead ends: 120040 [2019-12-27 20:02:15,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:15,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120040 states. [2019-12-27 20:02:21,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120040 to 80470. [2019-12-27 20:02:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80470 states. [2019-12-27 20:02:22,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80470 states to 80470 states and 279696 transitions. [2019-12-27 20:02:22,099 INFO L78 Accepts]: Start accepts. Automaton has 80470 states and 279696 transitions. Word has length 35 [2019-12-27 20:02:22,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:22,099 INFO L462 AbstractCegarLoop]: Abstraction has 80470 states and 279696 transitions. [2019-12-27 20:02:22,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:02:22,099 INFO L276 IsEmpty]: Start isEmpty. Operand 80470 states and 279696 transitions. [2019-12-27 20:02:22,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-27 20:02:22,198 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:22,198 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] [2019-12-27 20:02:22,198 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:22,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash 700182320, now seen corresponding path program 1 times [2019-12-27 20:02:22,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:22,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557050876] [2019-12-27 20:02:22,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:22,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:22,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:22,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557050876] [2019-12-27 20:02:22,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:22,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:02:22,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990242152] [2019-12-27 20:02:22,265 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:22,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:22,308 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 126 states and 204 transitions. [2019-12-27 20:02:22,308 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:22,331 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:02:22,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:02:22,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:22,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:02:22,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:22,334 INFO L87 Difference]: Start difference. First operand 80470 states and 279696 transitions. Second operand 6 states. [2019-12-27 20:02:22,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:22,670 INFO L93 Difference]: Finished difference Result 16701 states and 51476 transitions. [2019-12-27 20:02:22,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:02:22,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-27 20:02:22,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:22,697 INFO L225 Difference]: With dead ends: 16701 [2019-12-27 20:02:22,697 INFO L226 Difference]: Without dead ends: 11980 [2019-12-27 20:02:22,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:02:22,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11980 states. [2019-12-27 20:02:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11980 to 9865. [2019-12-27 20:02:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9865 states. [2019-12-27 20:02:23,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 28877 transitions. [2019-12-27 20:02:23,438 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 28877 transitions. Word has length 36 [2019-12-27 20:02:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:23,438 INFO L462 AbstractCegarLoop]: Abstraction has 9865 states and 28877 transitions. [2019-12-27 20:02:23,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:02:23,439 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 28877 transitions. [2019-12-27 20:02:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 20:02:23,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:23,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:23,450 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:23,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:23,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1368466382, now seen corresponding path program 1 times [2019-12-27 20:02:23,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:23,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563081204] [2019-12-27 20:02:23,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:23,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563081204] [2019-12-27 20:02:23,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:23,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:02:23,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [409788477] [2019-12-27 20:02:23,556 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:23,567 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:23,603 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 95 transitions. [2019-12-27 20:02:23,603 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:23,604 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:23,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:02:23,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:23,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:02:23,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:02:23,605 INFO L87 Difference]: Start difference. First operand 9865 states and 28877 transitions. Second operand 4 states. [2019-12-27 20:02:23,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:23,662 INFO L93 Difference]: Finished difference Result 10914 states and 31256 transitions. [2019-12-27 20:02:23,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:02:23,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-27 20:02:23,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:23,679 INFO L225 Difference]: With dead ends: 10914 [2019-12-27 20:02:23,679 INFO L226 Difference]: Without dead ends: 9876 [2019-12-27 20:02:23,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:02:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9876 states. [2019-12-27 20:02:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9876 to 9859. [2019-12-27 20:02:23,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9859 states. [2019-12-27 20:02:23,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9859 states to 9859 states and 28793 transitions. [2019-12-27 20:02:23,804 INFO L78 Accepts]: Start accepts. Automaton has 9859 states and 28793 transitions. Word has length 47 [2019-12-27 20:02:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:23,804 INFO L462 AbstractCegarLoop]: Abstraction has 9859 states and 28793 transitions. [2019-12-27 20:02:23,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:02:23,804 INFO L276 IsEmpty]: Start isEmpty. Operand 9859 states and 28793 transitions. [2019-12-27 20:02:23,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 20:02:23,815 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:23,815 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:23,815 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:23,815 INFO L82 PathProgramCache]: Analyzing trace with hash -82607882, now seen corresponding path program 2 times [2019-12-27 20:02:23,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:23,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595894401] [2019-12-27 20:02:23,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:23,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:23,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595894401] [2019-12-27 20:02:23,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:23,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:02:23,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1663818286] [2019-12-27 20:02:23,873 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:23,883 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:23,913 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 62 states and 72 transitions. [2019-12-27 20:02:23,913 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:23,913 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:23,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:02:23,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:23,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:02:23,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:23,914 INFO L87 Difference]: Start difference. First operand 9859 states and 28793 transitions. Second operand 3 states. [2019-12-27 20:02:23,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:23,980 INFO L93 Difference]: Finished difference Result 15391 states and 42547 transitions. [2019-12-27 20:02:23,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:02:23,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-27 20:02:23,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:23,997 INFO L225 Difference]: With dead ends: 15391 [2019-12-27 20:02:23,997 INFO L226 Difference]: Without dead ends: 9640 [2019-12-27 20:02:23,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:02:24,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9640 states. [2019-12-27 20:02:24,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9640 to 9588. [2019-12-27 20:02:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9588 states. [2019-12-27 20:02:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9588 states to 9588 states and 24311 transitions. [2019-12-27 20:02:24,112 INFO L78 Accepts]: Start accepts. Automaton has 9588 states and 24311 transitions. Word has length 47 [2019-12-27 20:02:24,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:24,112 INFO L462 AbstractCegarLoop]: Abstraction has 9588 states and 24311 transitions. [2019-12-27 20:02:24,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:02:24,112 INFO L276 IsEmpty]: Start isEmpty. Operand 9588 states and 24311 transitions. [2019-12-27 20:02:24,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 20:02:24,121 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:24,121 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:24,121 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:24,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1179496772, now seen corresponding path program 3 times [2019-12-27 20:02:24,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:24,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675242384] [2019-12-27 20:02:24,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:24,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:24,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675242384] [2019-12-27 20:02:24,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:24,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:02:24,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [451460087] [2019-12-27 20:02:24,205 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:24,217 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:24,246 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 61 transitions. [2019-12-27 20:02:24,247 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:24,247 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:02:24,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:02:24,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:02:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:02:24,248 INFO L87 Difference]: Start difference. First operand 9588 states and 24311 transitions. Second operand 6 states. [2019-12-27 20:02:24,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:24,352 INFO L93 Difference]: Finished difference Result 7979 states and 20671 transitions. [2019-12-27 20:02:24,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:02:24,353 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-27 20:02:24,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:24,354 INFO L225 Difference]: With dead ends: 7979 [2019-12-27 20:02:24,354 INFO L226 Difference]: Without dead ends: 444 [2019-12-27 20:02:24,355 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-27 20:02:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-12-27 20:02:24,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2019-12-27 20:02:24,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2019-12-27 20:02:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 961 transitions. [2019-12-27 20:02:24,363 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 961 transitions. Word has length 47 [2019-12-27 20:02:24,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:24,364 INFO L462 AbstractCegarLoop]: Abstraction has 444 states and 961 transitions. [2019-12-27 20:02:24,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:02:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 961 transitions. [2019-12-27 20:02:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 20:02:24,365 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:24,365 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:24,365 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:24,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:24,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1909019652, now seen corresponding path program 1 times [2019-12-27 20:02:24,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:24,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037526552] [2019-12-27 20:02:24,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:02:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:02:24,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037526552] [2019-12-27 20:02:24,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:02:24,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:02:24,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1655454011] [2019-12-27 20:02:24,471 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:02:24,493 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:02:24,665 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 273 transitions. [2019-12-27 20:02:24,665 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:02:24,745 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 20:02:24,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:02:24,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:02:24,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:02:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:02:24,746 INFO L87 Difference]: Start difference. First operand 444 states and 961 transitions. Second operand 10 states. [2019-12-27 20:02:26,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:02:26,109 INFO L93 Difference]: Finished difference Result 3380 states and 7340 transitions. [2019-12-27 20:02:26,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-27 20:02:26,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 63 [2019-12-27 20:02:26,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:02:26,113 INFO L225 Difference]: With dead ends: 3380 [2019-12-27 20:02:26,113 INFO L226 Difference]: Without dead ends: 2068 [2019-12-27 20:02:26,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=340, Invalid=1466, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 20:02:26,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2068 states. [2019-12-27 20:02:26,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2068 to 828. [2019-12-27 20:02:26,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 828 states. [2019-12-27 20:02:26,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1839 transitions. [2019-12-27 20:02:26,130 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1839 transitions. Word has length 63 [2019-12-27 20:02:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:02:26,130 INFO L462 AbstractCegarLoop]: Abstraction has 828 states and 1839 transitions. [2019-12-27 20:02:26,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:02:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1839 transitions. [2019-12-27 20:02:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 20:02:26,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:02:26,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:02:26,131 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:02:26,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:02:26,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1974293500, now seen corresponding path program 2 times [2019-12-27 20:02:26,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:02:26,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705925624] [2019-12-27 20:02:26,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:02:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:02:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:02:26,258 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:02:26,258 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:02:26,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1024] [1024] ULTIMATE.startENTRY-->L838: Formula: (let ((.cse0 (store |v_#valid_65| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= 0 v_~weak$$choice0~0_10) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t284~0.base_27|) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~__unbuffered_p1_EAX~0_13) (= 0 v_~z$r_buff1_thd3~0_41) (= v_~main$tmp_guard1~0_18 0) (= v_~z$r_buff0_thd3~0_78 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t284~0.base_27|)) (= |v_ULTIMATE.start_main_~#t284~0.offset_21| 0) (= 0 v_~z$r_buff1_thd2~0_28) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff1_thd1~0_8 0) (= v_~z~0_26 0) (= |v_#valid_63| (store .cse0 |v_ULTIMATE.start_main_~#t284~0.base_27| 1)) (= 0 v_~z$w_buff1~0_35) (= v_~x~0_15 0) (= 0 v_~y~0_7) (= v_~__unbuffered_p2_EBX~0_12 0) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$flush_delayed~0_17) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$w_buff0_used~0_134 0) (= v_~a~0_10 0) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_54 0) (= 0 v_~z$r_buff1_thd0~0_22) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_9 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t284~0.base_27|) |v_ULTIMATE.start_main_~#t284~0.offset_21| 0)) |v_#memory_int_23|) (= 0 v_~weak$$choice2~0_35) (= 0 v_~__unbuffered_p2_EAX~0_12) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t284~0.base_27| 4)) (= v_~z$mem_tmp~0_12 0) (= 0 v_~__unbuffered_cnt~0_22) (= 0 v_~z$w_buff1_used~0_71) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~z$w_buff0~0_35))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_22|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_28, #NULL.offset=|v_#NULL.offset_6|, ~a~0=v_~a~0_10, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_13, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~z$mem_tmp~0=v_~z$mem_tmp~0_12, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_12, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_71, ~z$flush_delayed~0=v_~z$flush_delayed~0_17, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_18|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_18|, ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_18|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ULTIMATE.start_main_~#t284~0.base=|v_ULTIMATE.start_main_~#t284~0.base_27|, ~x~0=v_~x~0_15, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t284~0.offset=|v_ULTIMATE.start_main_~#t284~0.offset_21|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_22, ~y~0=v_~y~0_7, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_54, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_134, ~z$w_buff0~0=v_~z$w_buff0~0_35, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_41, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_22|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_10|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_26, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t286~0.offset, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_~#t285~0.offset, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t284~0.base, ~x~0, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t284~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t286~0.base, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:02:26,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [974] [974] L838-1-->L840: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t285~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t285~0.base_10|) |v_ULTIMATE.start_main_~#t285~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t285~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t285~0.offset_9|) (not (= |v_ULTIMATE.start_main_~#t285~0.base_10| 0)) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t285~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t285~0.offset=|v_ULTIMATE.start_main_~#t285~0.offset_9|, ULTIMATE.start_main_~#t285~0.base=|v_ULTIMATE.start_main_~#t285~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_4|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t285~0.offset, ULTIMATE.start_main_~#t285~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 20:02:26,266 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [990] [990] L840-1-->L842: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t286~0.base_11| 4) |v_#length_17|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t286~0.base_11|) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11| 1)) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t286~0.base_11|)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t286~0.base_11|) |v_ULTIMATE.start_main_~#t286~0.offset_10| 2)) |v_#memory_int_17|) (= |v_ULTIMATE.start_main_~#t286~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t286~0.base=|v_ULTIMATE.start_main_~#t286~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t286~0.offset=|v_ULTIMATE.start_main_~#t286~0.offset_10|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t286~0.base, #length, ULTIMATE.start_main_~#t286~0.offset] because there is no mapped edge [2019-12-27 20:02:26,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] P2ENTRY-->L4-3: Formula: (and (= 0 (mod v_~z$w_buff1_used~0_53 256)) (= 1 v_~z$w_buff0~0_24) (= v_P2Thread1of1ForFork0_~arg.base_5 |v_P2Thread1of1ForFork0_#in~arg.base_5|) (= v_~z$w_buff0_used~0_99 1) (= v_P2Thread1of1ForFork0_~arg.offset_5 |v_P2Thread1of1ForFork0_#in~arg.offset_5|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5| v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7) (= v_~z$w_buff0_used~0_100 v_~z$w_buff1_used~0_53) (= v_~z$w_buff0~0_25 v_~z$w_buff1~0_22) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_100, ~z$w_buff0~0=v_~z$w_buff0~0_25, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_5, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_5|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_99, ~z$w_buff0~0=v_~z$w_buff0~0_24, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_5, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_53, ~z$w_buff1~0=v_~z$w_buff1~0_22, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_5|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P2Thread1of1ForFork0___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 20:02:26,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [954] [954] L800-2-->L800-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-350966710 256))) (.cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out-350966710| |P2Thread1of1ForFork0_#t~ite29_Out-350966710|)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-350966710 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out-350966710| ~z$w_buff1~0_In-350966710) (or .cse0 .cse1) .cse2) (and (not .cse0) .cse2 (= |P2Thread1of1ForFork0_#t~ite28_Out-350966710| ~z$w_buff0~0_In-350966710) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-350966710, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-350966710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-350966710, ~z$w_buff1~0=~z$w_buff1~0_In-350966710} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out-350966710|, ~z$w_buff0~0=~z$w_buff0~0_In-350966710, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-350966710, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-350966710, ~z$w_buff1~0=~z$w_buff1~0_In-350966710, P2Thread1of1ForFork0_#t~ite29=|P2Thread1of1ForFork0_#t~ite29_Out-350966710|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 20:02:26,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L805-->L806: Formula: (and (= v_~z$r_buff0_thd3~0_57 v_~z$r_buff0_thd3~0_56) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_57, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_56, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 20:02:26,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L808-->L808-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1041090649 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite48_Out1041090649| ~z$mem_tmp~0_In1041090649) (not .cse0)) (and .cse0 (= ~z~0_In1041090649 |P2Thread1of1ForFork0_#t~ite48_Out1041090649|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1041090649, ~z$flush_delayed~0=~z$flush_delayed~0_In1041090649, ~z~0=~z~0_In1041090649} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out1041090649|, ~z$mem_tmp~0=~z$mem_tmp~0_In1041090649, ~z$flush_delayed~0=~z$flush_delayed~0_In1041090649, ~z~0=~z~0_In1041090649} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-27 20:02:26,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] P0ENTRY-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 1 v_~a~0_7) (= v_P0Thread1of1ForFork1_~arg.base_5 |v_P0Thread1of1ForFork1_#in~arg.base_5|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_P0Thread1of1ForFork1_~arg.offset_5 |v_P0Thread1of1ForFork1_#in~arg.offset_5|) (= 1 v_~x~0_8) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|} OutVars{~a~0=v_~a~0_7, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_5, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_5|, ~x~0=v_~x~0_8, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_5} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 20:02:26,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In484723073 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In484723073 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In484723073 |P2Thread1of1ForFork0_#t~ite51_Out484723073|)) (and (= 0 |P2Thread1of1ForFork0_#t~ite51_Out484723073|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In484723073, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In484723073} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In484723073, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In484723073, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out484723073|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-27 20:02:26,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In186571754 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In186571754 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In186571754 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In186571754 256)))) (or (and (= ~z$w_buff1_used~0_In186571754 |P2Thread1of1ForFork0_#t~ite52_Out186571754|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork0_#t~ite52_Out186571754| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In186571754, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In186571754, ~z$w_buff1_used~0=~z$w_buff1_used~0_In186571754, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In186571754} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In186571754, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In186571754, ~z$w_buff1_used~0=~z$w_buff1_used~0_In186571754, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out186571754|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In186571754} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-27 20:02:26,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L818-->L819: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1403659098 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1403659098 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd3~0_Out-1403659098 0)) (and (= ~z$r_buff0_thd3~0_In-1403659098 ~z$r_buff0_thd3~0_Out-1403659098) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1403659098, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1403659098} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1403659098, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_Out-1403659098, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out-1403659098|} AuxVars[] AssignedVars[~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-27 20:02:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-73677109 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-73677109 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-73677109 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-73677109 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite54_Out-73677109|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$r_buff1_thd3~0_In-73677109 |P2Thread1of1ForFork0_#t~ite54_Out-73677109|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-73677109, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-73677109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-73677109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-73677109} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-73677109, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out-73677109|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-73677109, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-73677109, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-73677109} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 20:02:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L819-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_37 |v_P2Thread1of1ForFork0_#t~ite54_8|) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= (+ v_~__unbuffered_cnt~0_18 1) v_~__unbuffered_cnt~0_17)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_37, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 20:02:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1118056230 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite25_Out1118056230| ~z$mem_tmp~0_In1118056230)) (and (= |P1Thread1of1ForFork2_#t~ite25_Out1118056230| ~z~0_In1118056230) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1118056230, ~z$flush_delayed~0=~z$flush_delayed~0_In1118056230, ~z~0=~z~0_In1118056230} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1118056230, ~z$flush_delayed~0=~z$flush_delayed~0_In1118056230, ~z~0=~z~0_In1118056230, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out1118056230|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:02:26,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L771-2-->P1EXIT: Formula: (and (= 0 v_~z$flush_delayed~0_13) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= |v_P1Thread1of1ForFork2_#t~ite25_8| v_~z~0_23) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~z~0=v_~z~0_23, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 20:02:26,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] L846-->L848-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~z$w_buff0_used~0_94 256)) (= 0 (mod v_~z$r_buff0_thd0~0_14 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_94, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 20:02:26,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L848-2-->L848-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In157305984 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In157305984 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out157305984| |ULTIMATE.start_main_#t~ite59_Out157305984|))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite58_Out157305984| ~z$w_buff1~0_In157305984) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite58_Out157305984| ~z~0_In157305984) (or .cse0 .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In157305984, ~z$w_buff1_used~0=~z$w_buff1_used~0_In157305984, ~z$w_buff1~0=~z$w_buff1~0_In157305984, ~z~0=~z~0_In157305984} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In157305984, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out157305984|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In157305984, ~z$w_buff1~0=~z$w_buff1~0_In157305984, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out157305984|, ~z~0=~z~0_In157305984} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 20:02:26,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L849-->L849-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In464247114 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In464247114 256) 0))) (or (and (= ~z$w_buff0_used~0_In464247114 |ULTIMATE.start_main_#t~ite60_Out464247114|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite60_Out464247114|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In464247114, ~z$w_buff0_used~0=~z$w_buff0_used~0_In464247114} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out464247114|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In464247114, ~z$w_buff0_used~0=~z$w_buff0_used~0_In464247114} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 20:02:26,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L850-->L850-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1200413345 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1200413345 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1200413345 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In1200413345 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out1200413345| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out1200413345| ~z$w_buff1_used~0_In1200413345)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1200413345, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1200413345, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1200413345, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1200413345} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1200413345, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1200413345|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1200413345, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1200413345, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1200413345} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 20:02:26,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L851-->L851-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In258318432 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In258318432 256)))) (or (and (= ~z$r_buff0_thd0~0_In258318432 |ULTIMATE.start_main_#t~ite62_Out258318432|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite62_Out258318432|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In258318432, ~z$w_buff0_used~0=~z$w_buff0_used~0_In258318432} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out258318432|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In258318432, ~z$w_buff0_used~0=~z$w_buff0_used~0_In258318432} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 20:02:26,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [952] [952] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-1156951931 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1156951931 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-1156951931 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1156951931 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1156951931| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out-1156951931| ~z$r_buff1_thd0~0_In-1156951931)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1156951931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1156951931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1156951931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1156951931} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1156951931|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1156951931, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1156951931, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1156951931, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1156951931} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 20:02:26,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L852-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~x~0_10 2) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_13 0) (= |v_ULTIMATE.start_main_#t~ite63_10| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~__unbuffered_p2_EBX~0_7 0)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_9|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x~0=v_~x~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:02:26,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:02:26 BasicIcfg [2019-12-27 20:02:26,417 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:02:26,420 INFO L168 Benchmark]: Toolchain (without parser) took 107122.06 ms. Allocated memory was 137.4 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 100.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 20:02:26,421 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 20:02:26,423 INFO L168 Benchmark]: CACSL2BoogieTranslator took 789.11 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 153.3 MB in the end (delta: -53.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:26,426 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.71 ms. Allocated memory is still 201.3 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:26,427 INFO L168 Benchmark]: Boogie Preprocessor took 40.73 ms. Allocated memory is still 201.3 MB. Free memory was 150.6 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:26,428 INFO L168 Benchmark]: RCFGBuilder took 972.86 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 92.5 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. [2019-12-27 20:02:26,430 INFO L168 Benchmark]: TraceAbstraction took 105245.57 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 91.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-27 20:02:26,438 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 789.11 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 99.8 MB in the beginning and 153.3 MB in the end (delta: -53.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.71 ms. Allocated memory is still 201.3 MB. Free memory was 153.3 MB in the beginning and 150.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.73 ms. Allocated memory is still 201.3 MB. Free memory was 150.6 MB in the beginning and 148.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 972.86 ms. Allocated memory is still 201.3 MB. Free memory was 148.0 MB in the beginning and 92.5 MB in the end (delta: 55.4 MB). Peak memory consumption was 55.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 105245.57 ms. Allocated memory was 201.3 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 91.9 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 196 ProgramPointsBefore, 106 ProgramPointsAfterwards, 242 TransitionsBefore, 127 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 8644 VarBasedMoverChecksPositive, 243 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 123784 CheckedPairsTotal, 125 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L838] FCALL, FORK 0 pthread_create(&t284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] FCALL, FORK 0 pthread_create(&t285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L842] FCALL, FORK 0 pthread_create(&t286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 3 z$r_buff0_thd3 = (_Bool)1 [L796] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L797] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L798] 3 z$flush_delayed = weak$$choice2 [L799] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L801] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L802] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L803] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L806] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 z = z$flush_delayed ? z$mem_tmp : z [L809] 3 z$flush_delayed = (_Bool)0 [L812] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 y = 1 [L756] 2 __unbuffered_p1_EAX = y [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 z$flush_delayed = weak$$choice2 [L762] 2 z$mem_tmp = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L764] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L765] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L765] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L766] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L769] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L816] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L817] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L844] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L849] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L850] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 187 locations, 2 error locations. Result: UNSAFE, OverallTime: 104.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 35.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3536 SDtfs, 7710 SDslu, 8188 SDs, 0 SdLazy, 5537 SolverSat, 515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1498 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=147966occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 57.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 528586 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 547 NumberOfCodeBlocks, 547 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 469 ConstructedInterpolants, 0 QuantifiedInterpolants, 50116 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...