/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:15:14,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:15:14,096 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:15:14,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:15:14,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:15:14,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:15:14,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:15:14,128 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:15:14,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:15:14,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:15:14,138 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:15:14,140 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:15:14,140 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:15:14,142 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:15:14,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:15:14,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:15:14,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:15:14,148 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:15:14,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:15:14,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:15:14,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:15:14,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:15:14,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:15:14,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:15:14,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:15:14,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:15:14,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:15:14,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:15:14,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:15:14,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:15:14,173 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:15:14,174 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:15:14,175 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:15:14,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:15:14,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:15:14,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:15:14,179 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:15:14,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:15:14,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:15:14,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:15:14,183 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:15:14,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:15:14,217 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:15:14,217 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:15:14,221 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:15:14,221 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:15:14,221 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:15:14,221 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:15:14,222 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:15:14,222 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:15:14,222 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:15:14,222 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:15:14,222 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:15:14,223 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:15:14,223 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:15:14,223 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:15:14,223 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:15:14,223 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:15:14,223 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:15:14,224 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:15:14,224 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:15:14,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:15:14,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:15:14,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:15:14,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:15:14,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:15:14,226 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:15:14,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:15:14,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:15:14,226 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:15:14,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:15:14,510 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:15:14,525 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:15:14,530 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:15:14,531 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:15:14,531 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:15:14,532 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-27 02:15:14,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75206a54/d5a51ccd753a4b7282d3e2fdfe88d215/FLAGf46b5afe7 [2019-12-27 02:15:15,166 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:15:15,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix031_power.opt.i [2019-12-27 02:15:15,180 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75206a54/d5a51ccd753a4b7282d3e2fdfe88d215/FLAGf46b5afe7 [2019-12-27 02:15:15,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75206a54/d5a51ccd753a4b7282d3e2fdfe88d215 [2019-12-27 02:15:15,437 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:15:15,439 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:15:15,440 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:15:15,440 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:15:15,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:15:15,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:15:15" (1/1) ... [2019-12-27 02:15:15,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d9b7dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:15, skipping insertion in model container [2019-12-27 02:15:15,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:15:15" (1/1) ... [2019-12-27 02:15:15,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:15:15,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:15:16,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:15:16,092 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:15:16,171 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:15:16,242 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:15:16,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16 WrapperNode [2019-12-27 02:15:16,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:15:16,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:15:16,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:15:16,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:15:16,253 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,313 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:15:16,314 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:15:16,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:15:16,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:15:16,322 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,322 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (1/1) ... [2019-12-27 02:15:16,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:15:16,349 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:15:16,349 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:15:16,349 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:15:16,351 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (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 02:15:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:15:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:15:16,436 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:15:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:15:16,437 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:15:16,437 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:15:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:15:16,438 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:15:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:15:16,438 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:15:16,439 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:15:16,440 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 02:15:17,159 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:15:17,160 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:15:17,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:15:17 BoogieIcfgContainer [2019-12-27 02:15:17,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:15:17,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:15:17,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:15:17,167 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:15:17,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:15:15" (1/3) ... [2019-12-27 02:15:17,169 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a6a591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:15:17, skipping insertion in model container [2019-12-27 02:15:17,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:15:16" (2/3) ... [2019-12-27 02:15:17,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18a6a591 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:15:17, skipping insertion in model container [2019-12-27 02:15:17,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:15:17" (3/3) ... [2019-12-27 02:15:17,172 INFO L109 eAbstractionObserver]: Analyzing ICFG mix031_power.opt.i [2019-12-27 02:15:17,184 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:15:17,184 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:15:17,197 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:15:17,198 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:15:17,234 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,235 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,235 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,236 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,236 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,237 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,242 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,243 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,244 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,245 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,246 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,247 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,248 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,249 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,250 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,251 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,252 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,253 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,254 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,255 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,256 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,257 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,258 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,259 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,261 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,262 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,268 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,269 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,273 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,274 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,274 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,275 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,276 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,276 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,277 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,278 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,279 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,284 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:15:17,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:15:17,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:15:17,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:15:17,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:15:17,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:15:17,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:15:17,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:15:17,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:15:17,323 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:15:17,341 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 167 transitions [2019-12-27 02:15:17,343 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 02:15:17,455 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 02:15:17,455 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:15:17,468 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 02:15:17,485 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 139 places, 167 transitions [2019-12-27 02:15:17,529 INFO L132 PetriNetUnfolder]: 35/165 cut-off events. [2019-12-27 02:15:17,529 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:15:17,534 INFO L76 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 165 events. 35/165 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 0/128 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-27 02:15:17,546 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-27 02:15:17,548 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:15:22,084 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 82 [2019-12-27 02:15:22,206 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 02:15:22,362 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 02:15:22,515 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 02:15:22,552 INFO L206 etLargeBlockEncoding]: Checked pairs total: 44937 [2019-12-27 02:15:22,552 INFO L214 etLargeBlockEncoding]: Total number of compositions: 105 [2019-12-27 02:15:22,556 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-27 02:15:22,891 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6574 states. [2019-12-27 02:15:22,893 INFO L276 IsEmpty]: Start isEmpty. Operand 6574 states. [2019-12-27 02:15:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 02:15:22,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:22,901 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 02:15:22,901 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:22,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:22,908 INFO L82 PathProgramCache]: Analyzing trace with hash 689015014, now seen corresponding path program 1 times [2019-12-27 02:15:22,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:22,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328191666] [2019-12-27 02:15:22,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:15:23,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328191666] [2019-12-27 02:15:23,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:23,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:15:23,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704879635] [2019-12-27 02:15:23,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:23,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:23,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:23,174 INFO L87 Difference]: Start difference. First operand 6574 states. Second operand 3 states. [2019-12-27 02:15:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:23,482 INFO L93 Difference]: Finished difference Result 6414 states and 21608 transitions. [2019-12-27 02:15:23,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:23,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 02:15:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:23,574 INFO L225 Difference]: With dead ends: 6414 [2019-12-27 02:15:23,574 INFO L226 Difference]: Without dead ends: 6042 [2019-12-27 02:15:23,576 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 02:15:23,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6042 states. [2019-12-27 02:15:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6042 to 6042. [2019-12-27 02:15:24,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6042 states. [2019-12-27 02:15:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6042 states to 6042 states and 20317 transitions. [2019-12-27 02:15:24,121 INFO L78 Accepts]: Start accepts. Automaton has 6042 states and 20317 transitions. Word has length 5 [2019-12-27 02:15:24,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:24,121 INFO L462 AbstractCegarLoop]: Abstraction has 6042 states and 20317 transitions. [2019-12-27 02:15:24,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6042 states and 20317 transitions. [2019-12-27 02:15:24,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:15:24,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:24,131 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:24,132 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:24,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash 288534667, now seen corresponding path program 1 times [2019-12-27 02:15:24,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:24,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164420594] [2019-12-27 02:15:24,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:24,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 02:15:24,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164420594] [2019-12-27 02:15:24,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:24,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:24,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071857339] [2019-12-27 02:15:24,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:24,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:24,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:24,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:24,237 INFO L87 Difference]: Start difference. First operand 6042 states and 20317 transitions. Second operand 3 states. [2019-12-27 02:15:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:24,286 INFO L93 Difference]: Finished difference Result 1215 states and 3009 transitions. [2019-12-27 02:15:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:24,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 02:15:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:24,294 INFO L225 Difference]: With dead ends: 1215 [2019-12-27 02:15:24,294 INFO L226 Difference]: Without dead ends: 1215 [2019-12-27 02:15:24,297 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 02:15:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2019-12-27 02:15:24,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1215. [2019-12-27 02:15:24,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1215 states. [2019-12-27 02:15:24,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 3009 transitions. [2019-12-27 02:15:24,338 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 3009 transitions. Word has length 11 [2019-12-27 02:15:24,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:24,338 INFO L462 AbstractCegarLoop]: Abstraction has 1215 states and 3009 transitions. [2019-12-27 02:15:24,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:24,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 3009 transitions. [2019-12-27 02:15:24,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:15:24,349 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:24,349 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:24,350 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:24,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:24,350 INFO L82 PathProgramCache]: Analyzing trace with hash -869921106, now seen corresponding path program 1 times [2019-12-27 02:15:24,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:24,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004701596] [2019-12-27 02:15:24,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:24,466 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 02:15:24,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004701596] [2019-12-27 02:15:24,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:24,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:15:24,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938839747] [2019-12-27 02:15:24,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:24,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:24,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:24,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:24,468 INFO L87 Difference]: Start difference. First operand 1215 states and 3009 transitions. Second operand 3 states. [2019-12-27 02:15:24,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:24,562 INFO L93 Difference]: Finished difference Result 1870 states and 4688 transitions. [2019-12-27 02:15:24,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:24,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 02:15:24,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:24,577 INFO L225 Difference]: With dead ends: 1870 [2019-12-27 02:15:24,577 INFO L226 Difference]: Without dead ends: 1870 [2019-12-27 02:15:24,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:24,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2019-12-27 02:15:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1354. [2019-12-27 02:15:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1354 states. [2019-12-27 02:15:24,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 3400 transitions. [2019-12-27 02:15:24,638 INFO L78 Accepts]: Start accepts. Automaton has 1354 states and 3400 transitions. Word has length 14 [2019-12-27 02:15:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:24,638 INFO L462 AbstractCegarLoop]: Abstraction has 1354 states and 3400 transitions. [2019-12-27 02:15:24,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1354 states and 3400 transitions. [2019-12-27 02:15:24,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:15:24,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:24,640 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:24,640 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:24,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:24,641 INFO L82 PathProgramCache]: Analyzing trace with hash -732651370, now seen corresponding path program 1 times [2019-12-27 02:15:24,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:24,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988525780] [2019-12-27 02:15:24,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:24,707 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 02:15:24,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988525780] [2019-12-27 02:15:24,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:24,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:24,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109280049] [2019-12-27 02:15:24,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:15:24,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:24,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:15:24,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:24,714 INFO L87 Difference]: Start difference. First operand 1354 states and 3400 transitions. Second operand 4 states. [2019-12-27 02:15:24,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:24,914 INFO L93 Difference]: Finished difference Result 1775 states and 4313 transitions. [2019-12-27 02:15:24,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:15:24,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:15:24,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:24,925 INFO L225 Difference]: With dead ends: 1775 [2019-12-27 02:15:24,925 INFO L226 Difference]: Without dead ends: 1775 [2019-12-27 02:15:24,926 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 02:15:24,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-27 02:15:24,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1643. [2019-12-27 02:15:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1643 states. [2019-12-27 02:15:24,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1643 states to 1643 states and 4018 transitions. [2019-12-27 02:15:24,978 INFO L78 Accepts]: Start accepts. Automaton has 1643 states and 4018 transitions. Word has length 14 [2019-12-27 02:15:24,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:24,979 INFO L462 AbstractCegarLoop]: Abstraction has 1643 states and 4018 transitions. [2019-12-27 02:15:24,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:24,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1643 states and 4018 transitions. [2019-12-27 02:15:24,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 02:15:24,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:24,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:24,980 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:24,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1514120075, now seen corresponding path program 1 times [2019-12-27 02:15:24,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:24,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402217213] [2019-12-27 02:15:24,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:25,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:25,065 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 02:15:25,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402217213] [2019-12-27 02:15:25,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:25,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:25,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964816792] [2019-12-27 02:15:25,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:15:25,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:15:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:25,068 INFO L87 Difference]: Start difference. First operand 1643 states and 4018 transitions. Second operand 4 states. [2019-12-27 02:15:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:25,223 INFO L93 Difference]: Finished difference Result 2036 states and 4889 transitions. [2019-12-27 02:15:25,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:15:25,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 02:15:25,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:25,236 INFO L225 Difference]: With dead ends: 2036 [2019-12-27 02:15:25,236 INFO L226 Difference]: Without dead ends: 2036 [2019-12-27 02:15:25,236 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 02:15:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2019-12-27 02:15:25,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1664. [2019-12-27 02:15:25,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-12-27 02:15:25,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 4070 transitions. [2019-12-27 02:15:25,282 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 4070 transitions. Word has length 14 [2019-12-27 02:15:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:25,283 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 4070 transitions. [2019-12-27 02:15:25,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 4070 transitions. [2019-12-27 02:15:25,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 02:15:25,286 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:25,286 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:25,287 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:25,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1710596290, now seen corresponding path program 1 times [2019-12-27 02:15:25,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:25,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002867659] [2019-12-27 02:15:25,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:25,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:25,370 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 02:15:25,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002867659] [2019-12-27 02:15:25,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:25,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:15:25,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877882399] [2019-12-27 02:15:25,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:15:25,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:15:25,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:25,373 INFO L87 Difference]: Start difference. First operand 1664 states and 4070 transitions. Second operand 4 states. [2019-12-27 02:15:25,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:25,395 INFO L93 Difference]: Finished difference Result 723 states and 1652 transitions. [2019-12-27 02:15:25,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:15:25,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 02:15:25,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:25,399 INFO L225 Difference]: With dead ends: 723 [2019-12-27 02:15:25,399 INFO L226 Difference]: Without dead ends: 723 [2019-12-27 02:15:25,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-27 02:15:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 703. [2019-12-27 02:15:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2019-12-27 02:15:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 1612 transitions. [2019-12-27 02:15:25,418 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 1612 transitions. Word has length 26 [2019-12-27 02:15:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:25,418 INFO L462 AbstractCegarLoop]: Abstraction has 703 states and 1612 transitions. [2019-12-27 02:15:25,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:25,419 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 1612 transitions. [2019-12-27 02:15:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:15:25,421 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:25,421 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:25,421 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:25,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:25,422 INFO L82 PathProgramCache]: Analyzing trace with hash -310616313, now seen corresponding path program 1 times [2019-12-27 02:15:25,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:25,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721570776] [2019-12-27 02:15:25,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:25,552 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 02:15:25,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721570776] [2019-12-27 02:15:25,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:25,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:15:25,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774520988] [2019-12-27 02:15:25,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:15:25,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:25,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:15:25,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:25,556 INFO L87 Difference]: Start difference. First operand 703 states and 1612 transitions. Second operand 4 states. [2019-12-27 02:15:25,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:25,575 INFO L93 Difference]: Finished difference Result 1112 states and 2596 transitions. [2019-12-27 02:15:25,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:15:25,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-27 02:15:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:25,578 INFO L225 Difference]: With dead ends: 1112 [2019-12-27 02:15:25,579 INFO L226 Difference]: Without dead ends: 428 [2019-12-27 02:15:25,579 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 02:15:25,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-12-27 02:15:25,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2019-12-27 02:15:25,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2019-12-27 02:15:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1015 transitions. [2019-12-27 02:15:25,657 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1015 transitions. Word has length 41 [2019-12-27 02:15:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:25,658 INFO L462 AbstractCegarLoop]: Abstraction has 428 states and 1015 transitions. [2019-12-27 02:15:25,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1015 transitions. [2019-12-27 02:15:25,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:15:25,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:25,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:25,662 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:25,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:25,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1541326249, now seen corresponding path program 2 times [2019-12-27 02:15:25,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:25,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105975570] [2019-12-27 02:15:25,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:25,757 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 02:15:25,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105975570] [2019-12-27 02:15:25,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:25,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:15:25,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919379440] [2019-12-27 02:15:25,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:15:25,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:15:25,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:15:25,761 INFO L87 Difference]: Start difference. First operand 428 states and 1015 transitions. Second operand 7 states. [2019-12-27 02:15:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:25,946 INFO L93 Difference]: Finished difference Result 824 states and 1900 transitions. [2019-12-27 02:15:25,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 02:15:25,947 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-27 02:15:25,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:25,951 INFO L225 Difference]: With dead ends: 824 [2019-12-27 02:15:25,952 INFO L226 Difference]: Without dead ends: 536 [2019-12-27 02:15:25,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:15:25,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2019-12-27 02:15:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 476. [2019-12-27 02:15:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-12-27 02:15:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 1097 transitions. [2019-12-27 02:15:25,965 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 1097 transitions. Word has length 41 [2019-12-27 02:15:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:25,966 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 1097 transitions. [2019-12-27 02:15:25,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:15:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 1097 transitions. [2019-12-27 02:15:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:15:25,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:25,968 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:25,968 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:25,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1953316183, now seen corresponding path program 3 times [2019-12-27 02:15:25,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:25,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809800061] [2019-12-27 02:15:25,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:25,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:26,070 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 02:15:26,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809800061] [2019-12-27 02:15:26,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:26,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:15:26,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739952441] [2019-12-27 02:15:26,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:15:26,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:26,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:15:26,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:26,072 INFO L87 Difference]: Start difference. First operand 476 states and 1097 transitions. Second operand 6 states. [2019-12-27 02:15:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:26,447 INFO L93 Difference]: Finished difference Result 808 states and 1797 transitions. [2019-12-27 02:15:26,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:15:26,447 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-27 02:15:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:26,453 INFO L225 Difference]: With dead ends: 808 [2019-12-27 02:15:26,453 INFO L226 Difference]: Without dead ends: 796 [2019-12-27 02:15:26,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:15:26,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2019-12-27 02:15:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 753. [2019-12-27 02:15:26,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-27 02:15:26,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1693 transitions. [2019-12-27 02:15:26,475 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1693 transitions. Word has length 41 [2019-12-27 02:15:26,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:26,475 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1693 transitions. [2019-12-27 02:15:26,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:15:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1693 transitions. [2019-12-27 02:15:26,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 02:15:26,477 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:26,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:26,478 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:26,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1269710711, now seen corresponding path program 4 times [2019-12-27 02:15:26,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:26,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008935182] [2019-12-27 02:15:26,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:26,637 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 02:15:26,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008935182] [2019-12-27 02:15:26,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:26,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:26,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72551972] [2019-12-27 02:15:26,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:26,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:26,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:26,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:26,639 INFO L87 Difference]: Start difference. First operand 753 states and 1693 transitions. Second operand 3 states. [2019-12-27 02:15:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:26,652 INFO L93 Difference]: Finished difference Result 751 states and 1688 transitions. [2019-12-27 02:15:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:26,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 02:15:26,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:26,658 INFO L225 Difference]: With dead ends: 751 [2019-12-27 02:15:26,658 INFO L226 Difference]: Without dead ends: 751 [2019-12-27 02:15:26,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:26,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2019-12-27 02:15:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 695. [2019-12-27 02:15:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-12-27 02:15:26,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1581 transitions. [2019-12-27 02:15:26,675 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1581 transitions. Word has length 41 [2019-12-27 02:15:26,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:26,677 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1581 transitions. [2019-12-27 02:15:26,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:26,677 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1581 transitions. [2019-12-27 02:15:26,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 02:15:26,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:26,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:26,682 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:26,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:26,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1106289564, now seen corresponding path program 1 times [2019-12-27 02:15:26,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:26,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482959322] [2019-12-27 02:15:26,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:26,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:15:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:15:26,793 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:15:26,794 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:15:26,798 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] ULTIMATE.startENTRY-->L810: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_96 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37|) 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd1~0_280 0) (= v_~y$mem_tmp~0_16 0) (= 0 v_~weak$$choice0~0_14) (= v_~z~0_66 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_614 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$flush_delayed~0_46) (= v_~x~0_15 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t835~0.base_37|) (= v_~y$r_buff1_thd0~0_156 0) (= |v_ULTIMATE.start_main_~#t835~0.offset_26| 0) (= v_~y$w_buff1_used~0_428 0) (= 0 v_~y$r_buff1_thd2~0_121) (= 0 v_~y$w_buff0~0_385) (= 0 v_~__unbuffered_p0_EAX~0_43) (= v_~main$tmp_guard1~0_39 0) (= v_~y~0_143 0) (= v_~a~0_73 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~__unbuffered_p0_EBX~0_65 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t835~0.base_37| 1)) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~main$tmp_guard0~0_21 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t835~0.base_37| 4)) (= 0 v_~y$r_buff0_thd2~0_193) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t835~0.base_37|) |v_ULTIMATE.start_main_~#t835~0.offset_26| 0)) |v_#memory_int_15|) (= v_~y$w_buff1~0_254 0) (= 0 |v_#NULL.base_3|) (= v_~weak$$choice2~0_115 0) (= v_~y$r_buff1_thd1~0_232 0) (= 0 v_~__unbuffered_p1_EAX~0_96) (= v_~y$r_buff0_thd0~0_131 0) (= 0 v_~__unbuffered_cnt~0_84))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t835~0.offset=|v_ULTIMATE.start_main_~#t835~0.offset_26|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_614, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_39, ULTIMATE.start_main_~#t835~0.base=|v_ULTIMATE.start_main_~#t835~0.base_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_232, ~a~0=v_~a~0_73, ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_43, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_96, ~y$w_buff0~0=v_~y$w_buff0~0_385, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_280, ~y$flush_delayed~0=v_~y$flush_delayed~0_46, #length=|v_#length_15|, ~y~0=v_~y~0_143, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_96, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_65, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_29|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_99|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_37|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_59|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_121, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ~y$w_buff1~0=v_~y$w_buff1~0_254, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_25|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_131, #valid=|v_#valid_52|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_193, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, ~z~0=v_~z~0_66, ~weak$$choice2~0=v_~weak$$choice2~0_115, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_156, ~x~0=v_~x~0_15, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_428} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t835~0.offset, ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t835~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~a~0, ULTIMATE.start_main_~#t836~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_~#t836~0.base, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 02:15:26,799 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L810-1-->L812: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t836~0.base_12|) |v_ULTIMATE.start_main_~#t836~0.offset_10| 1)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t836~0.base_12| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t836~0.base_12| 4)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t836~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t836~0.offset_10|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t836~0.base_12| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t836~0.offset=|v_ULTIMATE.start_main_~#t836~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t836~0.base=|v_ULTIMATE.start_main_~#t836~0.base_12|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t836~0.offset, ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, ULTIMATE.start_main_~#t836~0.base, #length] because there is no mapped edge [2019-12-27 02:15:26,800 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L5-->L787: Formula: (and (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-232869061 0)) (= ~y$r_buff0_thd0~0_In-232869061 ~y$r_buff1_thd0~0_Out-232869061) (= ~a~0_In-232869061 ~__unbuffered_p1_EBX~0_Out-232869061) (= ~y$r_buff0_thd2~0_Out-232869061 1) (= ~z~0_Out-232869061 ~__unbuffered_p1_EAX~0_Out-232869061) (= ~y$r_buff1_thd1~0_Out-232869061 ~y$r_buff0_thd1~0_In-232869061) (= ~y$r_buff1_thd2~0_Out-232869061 ~y$r_buff0_thd2~0_In-232869061) (= ~z~0_Out-232869061 1)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-232869061, ~a~0=~a~0_In-232869061, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-232869061, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-232869061, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-232869061} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-232869061, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-232869061, ~a~0=~a~0_In-232869061, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-232869061, ~__unbuffered_p1_EBX~0=~__unbuffered_p1_EBX~0_Out-232869061, ~__unbuffered_p1_EAX~0=~__unbuffered_p1_EAX~0_Out-232869061, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-232869061, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-232869061, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-232869061, ~z~0=~z~0_Out-232869061, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-232869061} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 02:15:26,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1361358159 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1361358159 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1361358159|)) (and (= ~y$w_buff0_used~0_In-1361358159 |P1Thread1of1ForFork1_#t~ite28_Out-1361358159|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1361358159, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1361358159} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1361358159, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1361358159, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1361358159|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 02:15:26,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [646] [646] L789-->L789-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In898676914 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In898676914 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In898676914 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In898676914 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite29_Out898676914|)) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In898676914 |P1Thread1of1ForFork1_#t~ite29_Out898676914|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In898676914, ~y$w_buff0_used~0=~y$w_buff0_used~0_In898676914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In898676914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In898676914} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In898676914, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out898676914|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In898676914, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In898676914, ~y$w_buff1_used~0=~y$w_buff1_used~0_In898676914} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 02:15:26,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [594] [594] L751-->L752: Formula: (and (= v_~y$r_buff0_thd1~0_84 v_~y$r_buff0_thd1~0_83) (not (= (mod v_~weak$$choice2~0_22 256) 0))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_84, ~weak$$choice2~0=v_~weak$$choice2~0_22} OutVars{P0Thread1of1ForFork0_#t~ite21=|v_P0Thread1of1ForFork0_#t~ite21_9|, P0Thread1of1ForFork0_#t~ite20=|v_P0Thread1of1ForFork0_#t~ite20_11|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_83, P0Thread1of1ForFork0_#t~ite19=|v_P0Thread1of1ForFork0_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_22} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite21, P0Thread1of1ForFork0_#t~ite20, ~y$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite19] because there is no mapped edge [2019-12-27 02:15:26,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L752-->L752-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In589429008 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In589429008 256)))) (or (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In589429008 256))) (= (mod ~y$w_buff0_used~0_In589429008 256) 0) (and .cse0 (= (mod ~y$r_buff1_thd1~0_In589429008 256) 0)))) .cse1 (= |P0Thread1of1ForFork0_#t~ite24_Out589429008| |P0Thread1of1ForFork0_#t~ite23_Out589429008|) (= ~y$r_buff1_thd1~0_In589429008 |P0Thread1of1ForFork0_#t~ite23_Out589429008|)) (and (not .cse1) (= ~y$r_buff1_thd1~0_In589429008 |P0Thread1of1ForFork0_#t~ite24_Out589429008|) (= |P0Thread1of1ForFork0_#t~ite23_In589429008| |P0Thread1of1ForFork0_#t~ite23_Out589429008|)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In589429008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In589429008, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In589429008, ~weak$$choice2~0=~weak$$choice2~0_In589429008, ~y$w_buff1_used~0=~y$w_buff1_used~0_In589429008, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_In589429008|} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In589429008, ~y$w_buff0_used~0=~y$w_buff0_used~0_In589429008, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In589429008, ~weak$$choice2~0=~weak$$choice2~0_In589429008, P0Thread1of1ForFork0_#t~ite24=|P0Thread1of1ForFork0_#t~ite24_Out589429008|, P0Thread1of1ForFork0_#t~ite23=|P0Thread1of1ForFork0_#t~ite23_Out589429008|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In589429008} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite24, P0Thread1of1ForFork0_#t~ite23] because there is no mapped edge [2019-12-27 02:15:26,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [627] [627] L754-->L762: Formula: (and (= 0 v_~y$flush_delayed~0_15) (= v_~y~0_40 v_~y$mem_tmp~0_4) (= v_~__unbuffered_cnt~0_31 (+ v_~__unbuffered_cnt~0_32 1)) (not (= 0 (mod v_~y$flush_delayed~0_16 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_23|, ~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 02:15:26,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L790-->L791: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In1295940995 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1295940995 256)))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out1295940995)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd2~0_In1295940995 ~y$r_buff0_thd2~0_Out1295940995)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1295940995, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1295940995} OutVars{P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out1295940995|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1295940995, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1295940995} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 02:15:26,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L791-->L791-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In438103920 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In438103920 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In438103920 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In438103920 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out438103920| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite31_Out438103920| ~y$r_buff1_thd2~0_In438103920) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In438103920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In438103920, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In438103920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438103920} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In438103920, ~y$w_buff0_used~0=~y$w_buff0_used~0_In438103920, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out438103920|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In438103920, ~y$w_buff1_used~0=~y$w_buff1_used~0_In438103920} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 02:15:26,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [664] [664] L791-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= |v_P1Thread1of1ForFork1_#t~ite31_30| v_~y$r_buff1_thd2~0_59)) InVars {P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_59, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_29|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:15:26,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [589] [589] L812-1-->L818: Formula: (and (= 2 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:15:26,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L818-2-->L818-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1815839712 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1815839712 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite34_Out-1815839712| ~y$w_buff1~0_In-1815839712) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1815839712| ~y~0_In-1815839712)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1815839712, ~y~0=~y~0_In-1815839712, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1815839712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1815839712} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1815839712, ~y~0=~y~0_In-1815839712, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1815839712, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1815839712|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1815839712} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 02:15:26,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [612] [612] L818-4-->L819: Formula: (= v_~y~0_31 |v_ULTIMATE.start_main_#t~ite34_12|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_12|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_13|, ~y~0=v_~y~0_31, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-27 02:15:26,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1455198686 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1455198686 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out1455198686| ~y$w_buff0_used~0_In1455198686)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite36_Out1455198686|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1455198686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1455198686} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1455198686, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1455198686, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1455198686|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-27 02:15:26,811 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [637] [637] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1584007734 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1584007734 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1584007734 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In1584007734 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1584007734|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~y$w_buff1_used~0_In1584007734 |ULTIMATE.start_main_#t~ite37_Out1584007734|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1584007734, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1584007734, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1584007734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1584007734} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1584007734, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1584007734, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1584007734|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1584007734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1584007734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-27 02:15:26,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [649] [649] L821-->L821-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-952356192 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-952356192 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-952356192| ~y$r_buff0_thd0~0_In-952356192)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite38_Out-952356192|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-952356192, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-952356192} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-952356192, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-952356192, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-952356192|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-27 02:15:26,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L822-->L822-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1396319717 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1396319717 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1396319717 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1396319717 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out1396319717| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite39_Out1396319717| ~y$r_buff1_thd0~0_In1396319717) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1396319717, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1396319717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1396319717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1396319717} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1396319717, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1396319717|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1396319717, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1396319717, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1396319717} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:15:26,813 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L822-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_67 0) (= 1 v_~__unbuffered_p1_EAX~0_67) (= v_~__unbuffered_p0_EBX~0_37 0) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 0) (= 1 v_~__unbuffered_p0_EAX~0_21) (= v_~main$tmp_guard1~0_19 0) (= v_~y$r_buff1_thd0~0_123 |v_ULTIMATE.start_main_#t~ite39_42|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_42|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_37, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_67, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_67, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_123, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_15|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:15:26,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:15:26 BasicIcfg [2019-12-27 02:15:26,873 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:15:26,875 INFO L168 Benchmark]: Toolchain (without parser) took 11436.95 ms. Allocated memory was 137.9 MB in the beginning and 392.7 MB in the end (delta: 254.8 MB). Free memory was 100.7 MB in the beginning and 131.9 MB in the end (delta: -31.2 MB). Peak memory consumption was 223.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:26,876 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 02:15:26,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.40 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 157.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:26,878 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.91 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:26,878 INFO L168 Benchmark]: Boogie Preprocessor took 35.10 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:26,879 INFO L168 Benchmark]: RCFGBuilder took 812.65 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 110.9 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:26,880 INFO L168 Benchmark]: TraceAbstraction took 9710.78 ms. Allocated memory was 202.9 MB in the beginning and 392.7 MB in the end (delta: 189.8 MB). Free memory was 110.9 MB in the beginning and 131.9 MB in the end (delta: -21.0 MB). Peak memory consumption was 168.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:26,889 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.40 ms. Allocated memory was 137.9 MB in the beginning and 202.9 MB in the end (delta: 65.0 MB). Free memory was 100.5 MB in the beginning and 157.7 MB in the end (delta: -57.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.91 ms. Allocated memory is still 202.9 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.10 ms. Allocated memory is still 202.9 MB. Free memory was 155.0 MB in the beginning and 152.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 812.65 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 110.9 MB in the end (delta: 42.0 MB). Peak memory consumption was 42.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9710.78 ms. Allocated memory was 202.9 MB in the beginning and 392.7 MB in the end (delta: 189.8 MB). Free memory was 110.9 MB in the beginning and 131.9 MB in the end (delta: -21.0 MB). Peak memory consumption was 168.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 139 ProgramPointsBefore, 67 ProgramPointsAfterwards, 167 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 8 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 20 ChoiceCompositions, 4461 VarBasedMoverChecksPositive, 173 VarBasedMoverChecksNegative, 36 SemBasedMoverChecksPositive, 178 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 44937 CheckedPairsTotal, 105 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L810] FCALL, FORK 0 pthread_create(&t835, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t836, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 2 y$w_buff1 = y$w_buff0 [L768] 2 y$w_buff0 = 1 [L769] 2 y$w_buff1_used = y$w_buff0_used [L770] 2 y$w_buff0_used = (_Bool)1 [L787] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 a = 1 [L736] 1 x = 1 [L739] 1 __unbuffered_p0_EAX = x [L742] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L743] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L744] 1 y$flush_delayed = weak$$choice2 [L745] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L788] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L746] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L747] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L747] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L749] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L750] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L752] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L818] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L820] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L821] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 133 locations, 2 error locations. Result: UNSAFE, OverallTime: 9.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1031 SDtfs, 786 SDslu, 1665 SDs, 0 SdLazy, 750 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6574occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 10 MinimizatonAttempts, 1199 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 290 NumberOfCodeBlocks, 290 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 36902 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...