/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/mix030_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:14:15,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:14:15,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:14:15,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:14:15,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:14:15,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:14:15,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:14:15,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:14:15,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:14:15,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:14:15,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:14:15,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:14:15,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:14:15,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:14:15,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:14:15,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:14:15,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:14:15,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:14:15,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:14:15,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:14:15,179 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:14:15,180 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:14:15,181 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:14:15,182 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:14:15,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:14:15,185 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:14:15,185 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:14:15,186 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:14:15,187 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:14:15,188 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:14:15,188 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:14:15,189 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:14:15,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:14:15,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:14:15,191 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:14:15,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:14:15,192 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:14:15,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:14:15,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:14:15,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:14:15,194 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:14:15,195 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:14:15,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:14:15,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:14:15,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:14:15,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:14:15,212 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:14:15,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:14:15,212 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:14:15,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:14:15,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:14:15,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:14:15,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:14:15,213 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:14:15,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:14:15,214 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:14:15,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:14:15,214 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:14:15,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:14:15,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:14:15,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:14:15,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:14:15,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:14:15,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:14:15,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:14:15,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:14:15,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:14:15,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:14:15,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:14:15,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:14:15,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:14:15,490 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:14:15,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:14:15,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:14:15,517 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:14:15,517 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:14:15,519 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2019-12-27 02:14:15,598 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2cd6f55f/258c3098db9b4eeaa75bc3d2e38ff11d/FLAGade88799c [2019-12-27 02:14:16,181 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:14:16,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2019-12-27 02:14:16,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2cd6f55f/258c3098db9b4eeaa75bc3d2e38ff11d/FLAGade88799c [2019-12-27 02:14:16,447 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2cd6f55f/258c3098db9b4eeaa75bc3d2e38ff11d [2019-12-27 02:14:16,458 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:14:16,460 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:14:16,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:14:16,461 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:14:16,465 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:14:16,466 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:14:16" (1/1) ... [2019-12-27 02:14:16,469 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4938e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:16, skipping insertion in model container [2019-12-27 02:14:16,469 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:14:16" (1/1) ... [2019-12-27 02:14:16,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:14:16,530 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:14:17,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:14:17,170 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:14:17,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:14:17,322 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:14:17,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17 WrapperNode [2019-12-27 02:14:17,323 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:14:17,324 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:14:17,324 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:14:17,324 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:14:17,333 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:14:17" (1/1) ... [2019-12-27 02:14:17,357 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:14:17" (1/1) ... [2019-12-27 02:14:17,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:14:17,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:14:17,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:14:17,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:14:17,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (1/1) ... [2019-12-27 02:14:17,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (1/1) ... [2019-12-27 02:14:17,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (1/1) ... [2019-12-27 02:14:17,420 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (1/1) ... [2019-12-27 02:14:17,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (1/1) ... [2019-12-27 02:14:17,438 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (1/1) ... [2019-12-27 02:14:17,445 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (1/1) ... [2019-12-27 02:14:17,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:14:17,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:14:17,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:14:17,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:14:17,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (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:14:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:14:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:14:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:14:17,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:14:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:14:17,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:14:17,525 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:14:17,525 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 02:14:17,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 02:14:17,526 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 02:14:17,526 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 02:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:14:17,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:14:17,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:14:17,531 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:14:18,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:14:18,482 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:14:18,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:14:18 BoogieIcfgContainer [2019-12-27 02:14:18,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:14:18,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:14:18,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:14:18,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:14:18,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:14:16" (1/3) ... [2019-12-27 02:14:18,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b336bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:14:18, skipping insertion in model container [2019-12-27 02:14:18,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:14:17" (2/3) ... [2019-12-27 02:14:18,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b336bf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:14:18, skipping insertion in model container [2019-12-27 02:14:18,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:14:18" (3/3) ... [2019-12-27 02:14:18,493 INFO L109 eAbstractionObserver]: Analyzing ICFG mix030_tso.opt.i [2019-12-27 02:14:18,504 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:14:18,504 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:14:18,520 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:14:18,521 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:14:18,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,574 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,576 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,576 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,577 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,578 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,578 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,578 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,582 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,583 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,584 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,585 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,592 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,593 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,596 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,597 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,597 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,597 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,597 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,599 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,599 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,599 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,600 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,601 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,602 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,603 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,603 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,604 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,605 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,606 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,607 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,608 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,609 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,610 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,611 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,612 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,613 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,617 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,625 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,642 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,643 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,644 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,647 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,649 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,653 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,653 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,656 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,657 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,660 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,662 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,663 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:14:18,679 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 02:14:18,701 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:14:18,701 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:14:18,701 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:14:18,701 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:14:18,701 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:14:18,701 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:14:18,701 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:14:18,702 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:14:18,719 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 270 transitions [2019-12-27 02:14:18,721 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-27 02:14:18,856 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-27 02:14:18,856 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:14:18,881 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-27 02:14:18,924 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-27 02:14:19,000 INFO L132 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-27 02:14:19,000 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:14:19,015 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 0/202 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-27 02:14:19,053 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 28796 [2019-12-27 02:14:19,055 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:14:22,710 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-12-27 02:14:25,577 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-27 02:14:25,733 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-27 02:14:25,819 INFO L206 etLargeBlockEncoding]: Checked pairs total: 145015 [2019-12-27 02:14:25,819 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-27 02:14:25,822 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 122 places, 142 transitions [2019-12-27 02:14:37,169 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 105210 states. [2019-12-27 02:14:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 105210 states. [2019-12-27 02:14:37,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 02:14:37,177 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:14:37,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:14:37,178 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:14:37,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:14:37,183 INFO L82 PathProgramCache]: Analyzing trace with hash 487193979, now seen corresponding path program 1 times [2019-12-27 02:14:37,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:14:37,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714918001] [2019-12-27 02:14:37,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:14:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:14:37,504 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:14:37,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714918001] [2019-12-27 02:14:37,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:14:37,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:14:37,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220320032] [2019-12-27 02:14:37,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:14:37,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:14:37,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:14:37,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:14:37,525 INFO L87 Difference]: Start difference. First operand 105210 states. Second operand 3 states. [2019-12-27 02:14:40,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:14:40,510 INFO L93 Difference]: Finished difference Result 105018 states and 475984 transitions. [2019-12-27 02:14:40,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:14:40,511 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 02:14:40,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:14:41,298 INFO L225 Difference]: With dead ends: 105018 [2019-12-27 02:14:41,298 INFO L226 Difference]: Without dead ends: 102886 [2019-12-27 02:14:41,300 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:14:45,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102886 states. [2019-12-27 02:14:47,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102886 to 102886. [2019-12-27 02:14:47,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102886 states. [2019-12-27 02:14:52,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102886 states to 102886 states and 466780 transitions. [2019-12-27 02:14:52,160 INFO L78 Accepts]: Start accepts. Automaton has 102886 states and 466780 transitions. Word has length 9 [2019-12-27 02:14:52,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:14:52,161 INFO L462 AbstractCegarLoop]: Abstraction has 102886 states and 466780 transitions. [2019-12-27 02:14:52,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:14:52,161 INFO L276 IsEmpty]: Start isEmpty. Operand 102886 states and 466780 transitions. [2019-12-27 02:14:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:14:52,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:14:52,168 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:14:52,168 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:14:52,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:14:52,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1814849602, now seen corresponding path program 1 times [2019-12-27 02:14:52,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:14:52,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514832196] [2019-12-27 02:14:52,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:14:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:14:52,249 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:14:52,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514832196] [2019-12-27 02:14:52,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:14:52,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:14:52,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431074875] [2019-12-27 02:14:52,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:14:52,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:14:52,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:14:52,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:14:52,253 INFO L87 Difference]: Start difference. First operand 102886 states and 466780 transitions. Second operand 4 states. [2019-12-27 02:14:54,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:14:54,589 INFO L93 Difference]: Finished difference Result 165574 states and 725216 transitions. [2019-12-27 02:14:54,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:14:54,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 02:14:54,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:14:55,157 INFO L225 Difference]: With dead ends: 165574 [2019-12-27 02:14:55,157 INFO L226 Difference]: Without dead ends: 165546 [2019-12-27 02:14:55,158 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:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165546 states. [2019-12-27 02:15:06,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165546 to 160294. [2019-12-27 02:15:06,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160294 states. [2019-12-27 02:15:07,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160294 states to 160294 states and 705940 transitions. [2019-12-27 02:15:07,051 INFO L78 Accepts]: Start accepts. Automaton has 160294 states and 705940 transitions. Word has length 15 [2019-12-27 02:15:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:07,051 INFO L462 AbstractCegarLoop]: Abstraction has 160294 states and 705940 transitions. [2019-12-27 02:15:07,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:07,051 INFO L276 IsEmpty]: Start isEmpty. Operand 160294 states and 705940 transitions. [2019-12-27 02:15:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 02:15:07,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:07,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:07,056 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:07,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:07,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1261715161, now seen corresponding path program 1 times [2019-12-27 02:15:07,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:07,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649462571] [2019-12-27 02:15:07,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:07,128 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:07,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649462571] [2019-12-27 02:15:07,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:07,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:07,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184077352] [2019-12-27 02:15:07,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:07,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:07,131 INFO L87 Difference]: Start difference. First operand 160294 states and 705940 transitions. Second operand 3 states. [2019-12-27 02:15:12,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:12,398 INFO L93 Difference]: Finished difference Result 124009 states and 506087 transitions. [2019-12-27 02:15:12,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:12,398 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 02:15:12,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:12,908 INFO L225 Difference]: With dead ends: 124009 [2019-12-27 02:15:12,908 INFO L226 Difference]: Without dead ends: 124009 [2019-12-27 02:15:12,909 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:14,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124009 states. [2019-12-27 02:15:16,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124009 to 124009. [2019-12-27 02:15:16,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124009 states. [2019-12-27 02:15:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124009 states to 124009 states and 506087 transitions. [2019-12-27 02:15:18,198 INFO L78 Accepts]: Start accepts. Automaton has 124009 states and 506087 transitions. Word has length 15 [2019-12-27 02:15:18,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:18,198 INFO L462 AbstractCegarLoop]: Abstraction has 124009 states and 506087 transitions. [2019-12-27 02:15:18,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:18,198 INFO L276 IsEmpty]: Start isEmpty. Operand 124009 states and 506087 transitions. [2019-12-27 02:15:18,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 02:15:18,200 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:18,200 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:18,201 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:18,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:18,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2125901826, now seen corresponding path program 1 times [2019-12-27 02:15:18,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:18,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359664803] [2019-12-27 02:15:18,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:18,273 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:18,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359664803] [2019-12-27 02:15:18,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:18,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:15:18,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658181998] [2019-12-27 02:15:18,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:15:18,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:18,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:15:18,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:18,275 INFO L87 Difference]: Start difference. First operand 124009 states and 506087 transitions. Second operand 4 states. [2019-12-27 02:15:18,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:18,470 INFO L93 Difference]: Finished difference Result 48600 states and 166166 transitions. [2019-12-27 02:15:18,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:15:18,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 02:15:18,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:18,560 INFO L225 Difference]: With dead ends: 48600 [2019-12-27 02:15:18,560 INFO L226 Difference]: Without dead ends: 48600 [2019-12-27 02:15:18,560 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:19,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48600 states. [2019-12-27 02:15:23,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48600 to 48600. [2019-12-27 02:15:23,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48600 states. [2019-12-27 02:15:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48600 states to 48600 states and 166166 transitions. [2019-12-27 02:15:24,049 INFO L78 Accepts]: Start accepts. Automaton has 48600 states and 166166 transitions. Word has length 16 [2019-12-27 02:15:24,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:24,049 INFO L462 AbstractCegarLoop]: Abstraction has 48600 states and 166166 transitions. [2019-12-27 02:15:24,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:24,050 INFO L276 IsEmpty]: Start isEmpty. Operand 48600 states and 166166 transitions. [2019-12-27 02:15:24,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 02:15:24,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:24,051 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:24,051 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:24,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:24,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2082717748, now seen corresponding path program 1 times [2019-12-27 02:15:24,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:24,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013348788] [2019-12-27 02:15:24,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:24,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:24,163 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,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013348788] [2019-12-27 02:15:24,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:24,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:15:24,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395746090] [2019-12-27 02:15:24,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:15:24,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:24,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:15:24,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:24,166 INFO L87 Difference]: Start difference. First operand 48600 states and 166166 transitions. Second operand 5 states. [2019-12-27 02:15:24,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:24,231 INFO L93 Difference]: Finished difference Result 6591 states and 18839 transitions. [2019-12-27 02:15:24,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:15:24,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-27 02:15:24,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:24,248 INFO L225 Difference]: With dead ends: 6591 [2019-12-27 02:15:24,248 INFO L226 Difference]: Without dead ends: 6591 [2019-12-27 02:15:24,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:24,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6591 states. [2019-12-27 02:15:24,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6591 to 6591. [2019-12-27 02:15:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6591 states. [2019-12-27 02:15:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6591 states to 6591 states and 18839 transitions. [2019-12-27 02:15:24,376 INFO L78 Accepts]: Start accepts. Automaton has 6591 states and 18839 transitions. Word has length 17 [2019-12-27 02:15:24,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:24,376 INFO L462 AbstractCegarLoop]: Abstraction has 6591 states and 18839 transitions. [2019-12-27 02:15:24,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:15:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6591 states and 18839 transitions. [2019-12-27 02:15:24,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 02:15:24,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:24,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:24,385 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:24,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:24,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1699372313, now seen corresponding path program 1 times [2019-12-27 02:15:24,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:24,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317233934] [2019-12-27 02:15:24,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:24,490 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,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317233934] [2019-12-27 02:15:24,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:24,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:15:24,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409766158] [2019-12-27 02:15:24,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:15:24,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:15:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:24,493 INFO L87 Difference]: Start difference. First operand 6591 states and 18839 transitions. Second operand 6 states. [2019-12-27 02:15:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:24,557 INFO L93 Difference]: Finished difference Result 3660 states and 11520 transitions. [2019-12-27 02:15:24,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:15:24,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 02:15:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:24,568 INFO L225 Difference]: With dead ends: 3660 [2019-12-27 02:15:24,568 INFO L226 Difference]: Without dead ends: 3660 [2019-12-27 02:15:24,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:24,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-12-27 02:15:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3464. [2019-12-27 02:15:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3464 states. [2019-12-27 02:15:24,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3464 states to 3464 states and 10960 transitions. [2019-12-27 02:15:24,636 INFO L78 Accepts]: Start accepts. Automaton has 3464 states and 10960 transitions. Word has length 29 [2019-12-27 02:15:24,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:24,636 INFO L462 AbstractCegarLoop]: Abstraction has 3464 states and 10960 transitions. [2019-12-27 02:15:24,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:15:24,636 INFO L276 IsEmpty]: Start isEmpty. Operand 3464 states and 10960 transitions. [2019-12-27 02:15:24,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:15:24,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:24,650 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:24,650 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1142900950, now seen corresponding path program 1 times [2019-12-27 02:15:24,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:24,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651530201] [2019-12-27 02:15:24,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:24,860 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,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651530201] [2019-12-27 02:15:24,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:24,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:15:24,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31509059] [2019-12-27 02:15:24,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:15:24,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:15:24,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:24,864 INFO L87 Difference]: Start difference. First operand 3464 states and 10960 transitions. Second operand 6 states. [2019-12-27 02:15:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:25,466 INFO L93 Difference]: Finished difference Result 5233 states and 16394 transitions. [2019-12-27 02:15:25,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:15:25,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-27 02:15:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:25,476 INFO L225 Difference]: With dead ends: 5233 [2019-12-27 02:15:25,476 INFO L226 Difference]: Without dead ends: 5233 [2019-12-27 02:15:25,477 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:15:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5233 states. [2019-12-27 02:15:25,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5233 to 3820. [2019-12-27 02:15:25,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3820 states. [2019-12-27 02:15:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3820 states to 3820 states and 12120 transitions. [2019-12-27 02:15:25,534 INFO L78 Accepts]: Start accepts. Automaton has 3820 states and 12120 transitions. Word has length 74 [2019-12-27 02:15:25,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:25,534 INFO L462 AbstractCegarLoop]: Abstraction has 3820 states and 12120 transitions. [2019-12-27 02:15:25,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:15:25,535 INFO L276 IsEmpty]: Start isEmpty. Operand 3820 states and 12120 transitions. [2019-12-27 02:15:25,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:15:25,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:25,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:25,544 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:25,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:25,545 INFO L82 PathProgramCache]: Analyzing trace with hash -617148552, now seen corresponding path program 2 times [2019-12-27 02:15:25,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:25,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861989779] [2019-12-27 02:15:25,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:25,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:25,677 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,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861989779] [2019-12-27 02:15:25,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:25,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:15:25,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622993388] [2019-12-27 02:15:25,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:15:25,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:15:25,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:25,680 INFO L87 Difference]: Start difference. First operand 3820 states and 12120 transitions. Second operand 5 states. [2019-12-27 02:15:26,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:26,007 INFO L93 Difference]: Finished difference Result 4381 states and 13710 transitions. [2019-12-27 02:15:26,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:15:26,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-27 02:15:26,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:26,020 INFO L225 Difference]: With dead ends: 4381 [2019-12-27 02:15:26,020 INFO L226 Difference]: Without dead ends: 4381 [2019-12-27 02:15:26,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:26,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4381 states. [2019-12-27 02:15:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4381 to 4060. [2019-12-27 02:15:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4060 states. [2019-12-27 02:15:26,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4060 states to 4060 states and 12832 transitions. [2019-12-27 02:15:26,114 INFO L78 Accepts]: Start accepts. Automaton has 4060 states and 12832 transitions. Word has length 74 [2019-12-27 02:15:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:26,115 INFO L462 AbstractCegarLoop]: Abstraction has 4060 states and 12832 transitions. [2019-12-27 02:15:26,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:15:26,115 INFO L276 IsEmpty]: Start isEmpty. Operand 4060 states and 12832 transitions. [2019-12-27 02:15:26,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:15:26,125 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:26,127 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:26,127 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:26,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash -115763946, now seen corresponding path program 3 times [2019-12-27 02:15:26,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:26,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630161547] [2019-12-27 02:15:26,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:26,251 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,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630161547] [2019-12-27 02:15:26,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:26,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:15:26,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566959867] [2019-12-27 02:15:26,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:15:26,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:26,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:15:26,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:26,253 INFO L87 Difference]: Start difference. First operand 4060 states and 12832 transitions. Second operand 6 states. [2019-12-27 02:15:26,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:26,819 INFO L93 Difference]: Finished difference Result 5166 states and 16084 transitions. [2019-12-27 02:15:26,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:15:26,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-27 02:15:26,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:26,829 INFO L225 Difference]: With dead ends: 5166 [2019-12-27 02:15:26,829 INFO L226 Difference]: Without dead ends: 5166 [2019-12-27 02:15:26,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:15:26,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5166 states. [2019-12-27 02:15:26,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5166 to 4424. [2019-12-27 02:15:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4424 states. [2019-12-27 02:15:26,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 13956 transitions. [2019-12-27 02:15:26,895 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 13956 transitions. Word has length 74 [2019-12-27 02:15:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:26,895 INFO L462 AbstractCegarLoop]: Abstraction has 4424 states and 13956 transitions. [2019-12-27 02:15:26,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:15:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 13956 transitions. [2019-12-27 02:15:26,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-27 02:15:26,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:26,905 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:26,905 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:26,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:26,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1912498904, now seen corresponding path program 4 times [2019-12-27 02:15:26,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:26,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172013463] [2019-12-27 02:15:26,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:27,000 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:27,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172013463] [2019-12-27 02:15:27,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:27,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:27,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618433753] [2019-12-27 02:15:27,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:27,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:27,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:27,002 INFO L87 Difference]: Start difference. First operand 4424 states and 13956 transitions. Second operand 3 states. [2019-12-27 02:15:27,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:27,274 INFO L93 Difference]: Finished difference Result 4423 states and 13954 transitions. [2019-12-27 02:15:27,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:27,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-27 02:15:27,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:27,286 INFO L225 Difference]: With dead ends: 4423 [2019-12-27 02:15:27,286 INFO L226 Difference]: Without dead ends: 4423 [2019-12-27 02:15:27,287 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:27,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4423 states. [2019-12-27 02:15:27,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4423 to 3602. [2019-12-27 02:15:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3602 states. [2019-12-27 02:15:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3602 states to 3602 states and 11536 transitions. [2019-12-27 02:15:27,380 INFO L78 Accepts]: Start accepts. Automaton has 3602 states and 11536 transitions. Word has length 74 [2019-12-27 02:15:27,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:27,381 INFO L462 AbstractCegarLoop]: Abstraction has 3602 states and 11536 transitions. [2019-12-27 02:15:27,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:27,382 INFO L276 IsEmpty]: Start isEmpty. Operand 3602 states and 11536 transitions. [2019-12-27 02:15:27,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 02:15:27,392 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:27,392 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:27,392 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:27,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:27,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1481768599, now seen corresponding path program 1 times [2019-12-27 02:15:27,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:27,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935781134] [2019-12-27 02:15:27,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:27,542 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:27,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935781134] [2019-12-27 02:15:27,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:27,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:15:27,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319345635] [2019-12-27 02:15:27,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:15:27,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:15:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:15:27,545 INFO L87 Difference]: Start difference. First operand 3602 states and 11536 transitions. Second operand 4 states. [2019-12-27 02:15:27,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:27,590 INFO L93 Difference]: Finished difference Result 5311 states and 16146 transitions. [2019-12-27 02:15:27,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:15:27,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-27 02:15:27,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:27,594 INFO L225 Difference]: With dead ends: 5311 [2019-12-27 02:15:27,594 INFO L226 Difference]: Without dead ends: 1936 [2019-12-27 02:15:27,594 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:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1936 states. [2019-12-27 02:15:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1936 to 1936. [2019-12-27 02:15:27,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2019-12-27 02:15:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 5209 transitions. [2019-12-27 02:15:27,624 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 5209 transitions. Word has length 75 [2019-12-27 02:15:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:27,624 INFO L462 AbstractCegarLoop]: Abstraction has 1936 states and 5209 transitions. [2019-12-27 02:15:27,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:15:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 5209 transitions. [2019-12-27 02:15:27,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-27 02:15:27,629 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:27,629 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:27,629 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:27,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:27,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1998741429, now seen corresponding path program 2 times [2019-12-27 02:15:27,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:27,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753854681] [2019-12-27 02:15:27,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:27,708 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:27,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753854681] [2019-12-27 02:15:27,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:27,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:15:27,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641180258] [2019-12-27 02:15:27,710 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:15:27,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:27,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:15:27,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:15:27,711 INFO L87 Difference]: Start difference. First operand 1936 states and 5209 transitions. Second operand 3 states. [2019-12-27 02:15:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:27,728 INFO L93 Difference]: Finished difference Result 1812 states and 4759 transitions. [2019-12-27 02:15:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:15:27,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-27 02:15:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:27,731 INFO L225 Difference]: With dead ends: 1812 [2019-12-27 02:15:27,731 INFO L226 Difference]: Without dead ends: 1812 [2019-12-27 02:15:27,732 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:27,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1812 states. [2019-12-27 02:15:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1812 to 1758. [2019-12-27 02:15:27,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1758 states. [2019-12-27 02:15:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1758 states to 1758 states and 4630 transitions. [2019-12-27 02:15:27,758 INFO L78 Accepts]: Start accepts. Automaton has 1758 states and 4630 transitions. Word has length 75 [2019-12-27 02:15:27,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:27,759 INFO L462 AbstractCegarLoop]: Abstraction has 1758 states and 4630 transitions. [2019-12-27 02:15:27,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:15:27,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1758 states and 4630 transitions. [2019-12-27 02:15:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 02:15:27,762 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:27,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:27,763 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:27,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1632957500, now seen corresponding path program 1 times [2019-12-27 02:15:27,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:27,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387113255] [2019-12-27 02:15:27,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:27,872 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:27,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387113255] [2019-12-27 02:15:27,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:27,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:15:27,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552687273] [2019-12-27 02:15:27,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:15:27,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:27,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:15:27,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:27,877 INFO L87 Difference]: Start difference. First operand 1758 states and 4630 transitions. Second operand 5 states. [2019-12-27 02:15:27,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:27,932 INFO L93 Difference]: Finished difference Result 1963 states and 4998 transitions. [2019-12-27 02:15:27,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:15:27,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-27 02:15:27,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:27,935 INFO L225 Difference]: With dead ends: 1963 [2019-12-27 02:15:27,935 INFO L226 Difference]: Without dead ends: 1064 [2019-12-27 02:15:27,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:15:27,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2019-12-27 02:15:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1064. [2019-12-27 02:15:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-12-27 02:15:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2391 transitions. [2019-12-27 02:15:27,946 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 2391 transitions. Word has length 76 [2019-12-27 02:15:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:27,946 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 2391 transitions. [2019-12-27 02:15:27,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:15:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 2391 transitions. [2019-12-27 02:15:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 02:15:27,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:27,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:27,948 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:27,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash -922298408, now seen corresponding path program 2 times [2019-12-27 02:15:27,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:27,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853388848] [2019-12-27 02:15:27,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:28,069 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:28,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853388848] [2019-12-27 02:15:28,069 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:28,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 02:15:28,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203588690] [2019-12-27 02:15:28,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:15:28,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:28,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:15:28,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:15:28,071 INFO L87 Difference]: Start difference. First operand 1064 states and 2391 transitions. Second operand 5 states. [2019-12-27 02:15:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:28,156 INFO L93 Difference]: Finished difference Result 1430 states and 3165 transitions. [2019-12-27 02:15:28,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:15:28,157 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-27 02:15:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:28,158 INFO L225 Difference]: With dead ends: 1430 [2019-12-27 02:15:28,158 INFO L226 Difference]: Without dead ends: 280 [2019-12-27 02:15:28,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:15:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2019-12-27 02:15:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 248. [2019-12-27 02:15:28,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-27 02:15:28,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 426 transitions. [2019-12-27 02:15:28,163 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 426 transitions. Word has length 76 [2019-12-27 02:15:28,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:28,163 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 426 transitions. [2019-12-27 02:15:28,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:15:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 426 transitions. [2019-12-27 02:15:28,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 02:15:28,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:28,164 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:28,165 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:28,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:28,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1568872212, now seen corresponding path program 3 times [2019-12-27 02:15:28,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:28,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146918669] [2019-12-27 02:15:28,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:28,346 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:28,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146918669] [2019-12-27 02:15:28,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:28,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:15:28,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024100968] [2019-12-27 02:15:28,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:15:28,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:28,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:15:28,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:15:28,348 INFO L87 Difference]: Start difference. First operand 248 states and 426 transitions. Second operand 7 states. [2019-12-27 02:15:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:28,468 INFO L93 Difference]: Finished difference Result 523 states and 913 transitions. [2019-12-27 02:15:28,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 02:15:28,469 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-27 02:15:28,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:28,469 INFO L225 Difference]: With dead ends: 523 [2019-12-27 02:15:28,469 INFO L226 Difference]: Without dead ends: 288 [2019-12-27 02:15:28,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 02:15:28,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2019-12-27 02:15:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 248. [2019-12-27 02:15:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-27 02:15:28,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 425 transitions. [2019-12-27 02:15:28,474 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 425 transitions. Word has length 76 [2019-12-27 02:15:28,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:28,474 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 425 transitions. [2019-12-27 02:15:28,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:15:28,474 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 425 transitions. [2019-12-27 02:15:28,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 02:15:28,475 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:28,475 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:28,476 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1125574762, now seen corresponding path program 1 times [2019-12-27 02:15:28,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:28,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551811515] [2019-12-27 02:15:28,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:15:28,681 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:28,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551811515] [2019-12-27 02:15:28,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:15:28,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 02:15:28,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051079645] [2019-12-27 02:15:28,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 02:15:28,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:15:28,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 02:15:28,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 02:15:28,685 INFO L87 Difference]: Start difference. First operand 248 states and 425 transitions. Second operand 12 states. [2019-12-27 02:15:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:15:29,079 INFO L93 Difference]: Finished difference Result 395 states and 667 transitions. [2019-12-27 02:15:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 02:15:29,080 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2019-12-27 02:15:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:15:29,080 INFO L225 Difference]: With dead ends: 395 [2019-12-27 02:15:29,080 INFO L226 Difference]: Without dead ends: 366 [2019-12-27 02:15:29,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-12-27 02:15:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2019-12-27 02:15:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 356. [2019-12-27 02:15:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-12-27 02:15:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 610 transitions. [2019-12-27 02:15:29,086 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 610 transitions. Word has length 77 [2019-12-27 02:15:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:15:29,086 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 610 transitions. [2019-12-27 02:15:29,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 02:15:29,086 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 610 transitions. [2019-12-27 02:15:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-27 02:15:29,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:15:29,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:15:29,088 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:15:29,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:15:29,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1455854044, now seen corresponding path program 2 times [2019-12-27 02:15:29,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:15:29,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301876475] [2019-12-27 02:15:29,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:15:29,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:15:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:15:29,245 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:15:29,245 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:15:29,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] ULTIMATE.startENTRY-->L839: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t829~0.base_24| 4) |v_#length_29|) (= 0 v_~z$flush_delayed~0_273) (= v_~z$r_buff0_thd1~0_51 0) (= 0 v_~z$r_buff1_thd3~0_297) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t829~0.base_24| 1)) (= |v_#NULL.offset_6| 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t829~0.base_24|) (= v_~z$r_buff1_thd1~0_205 0) (= 0 |v_ULTIMATE.start_main_~#t829~0.offset_19|) (= 0 v_~z$r_buff1_thd4~0_383) (= v_~z$r_buff0_thd0~0_482 0) (= v_~main$tmp_guard0~0_25 0) (= v_~z$w_buff1~0_315 0) (= 0 v_~__unbuffered_p3_EBX~0_63) (= v_~z$read_delayed~0_6 0) (= v_~z$read_delayed_var~0.offset_7 0) (= 0 v_~z$r_buff0_thd4~0_518) (= 0 v_~__unbuffered_p3_EAX~0_73) (= v_~y~0_126 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff0~0_383 0) (= 0 v_~x~0_106) (= 0 v_~z$mem_tmp~0_243) (= v_~z$r_buff0_thd2~0_50 0) (= v_~z~0_295 0) (= v_~z$read_delayed_var~0.base_7 0) (= 0 v_~z$r_buff0_thd3~0_133) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t829~0.base_24| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t829~0.base_24|) |v_ULTIMATE.start_main_~#t829~0.offset_19| 0)) |v_#memory_int_27|) (= v_~weak$$choice2~0_323 0) (= v_~main$tmp_guard1~0_64 0) (= v_~__unbuffered_cnt~0_220 0) (= v_~z$w_buff1_used~0_723 0) (= 0 v_~weak$$choice0~0_232) (= v_~z$w_buff0_used~0_1076 0) (= v_~a~0_53 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t829~0.base_24|)) (= v_~z$r_buff1_thd2~0_205 0) (= v_~z$r_buff1_thd0~0_494 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_205, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_76|, ULTIMATE.start_main_~#t832~0.offset=|v_ULTIMATE.start_main_~#t832~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_94|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_52|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_44|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_42|, ~a~0=v_~a~0_53, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_95|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_482, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_518, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_73, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_60|, ~z$mem_tmp~0=v_~z$mem_tmp~0_243, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_24|, ULTIMATE.start_main_~#t830~0.offset=|v_ULTIMATE.start_main_~#t830~0.offset_18|, ULTIMATE.start_main_~#t830~0.base=|v_ULTIMATE.start_main_~#t830~0.base_23|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_34|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_723, ~z$flush_delayed~0=v_~z$flush_delayed~0_273, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_139|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_60|, ULTIMATE.start_main_~#t831~0.base=|v_ULTIMATE.start_main_~#t831~0.base_23|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_226|, ~weak$$choice0~0=v_~weak$$choice0~0_232, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_154|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_205, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_133, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_220, ~x~0=v_~x~0_106, ULTIMATE.start_main_~#t829~0.base=|v_ULTIMATE.start_main_~#t829~0.base_24|, ULTIMATE.start_main_~#t832~0.base=|v_ULTIMATE.start_main_~#t832~0.base_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_383, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_34|, ~z$w_buff1~0=v_~z$w_buff1~0_315, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_64, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_83|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_38|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_79|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_224|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_494, ULTIMATE.start_main_~#t831~0.offset=|v_ULTIMATE.start_main_~#t831~0.offset_18|, ULTIMATE.start_main_~#t829~0.offset=|v_ULTIMATE.start_main_~#t829~0.offset_19|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_60|, ~y~0=v_~y~0_126, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_50, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1076, ~z$w_buff0~0=v_~z$w_buff0~0_383, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_297, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_70|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_41|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_63, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_133|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_53|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_147|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_55|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_295, ~weak$$choice2~0=v_~weak$$choice2~0_323, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_51} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t832~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet48, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t830~0.offset, ULTIMATE.start_main_~#t830~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_~#t831~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t829~0.base, ULTIMATE.start_main_~#t832~0.base, ~z$r_buff1_thd4~0, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t831~0.offset, ULTIMATE.start_main_~#t829~0.offset, ULTIMATE.start_main_#t~nondet49, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet40, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 02:15:29,251 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t830~0.offset_9| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t830~0.base_10| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t830~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t830~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t830~0.base_10|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t830~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t830~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t830~0.base_10|) |v_ULTIMATE.start_main_~#t830~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t830~0.offset=|v_ULTIMATE.start_main_~#t830~0.offset_9|, ULTIMATE.start_main_~#t830~0.base=|v_ULTIMATE.start_main_~#t830~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t830~0.offset, ULTIMATE.start_main_~#t830~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 02:15:29,253 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L841-1-->L843: Formula: (and (= |v_ULTIMATE.start_main_~#t831~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t831~0.base_12| 4) |v_#length_19|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t831~0.base_12|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t831~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t831~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t831~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t831~0.base_12|) |v_ULTIMATE.start_main_~#t831~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t831~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t831~0.offset=|v_ULTIMATE.start_main_~#t831~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t831~0.base=|v_ULTIMATE.start_main_~#t831~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t831~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t831~0.base] because there is no mapped edge [2019-12-27 02:15:29,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t832~0.base_13|) (= (store |v_#valid_53| |v_ULTIMATE.start_main_~#t832~0.base_13| 1) |v_#valid_52|) (= |v_ULTIMATE.start_main_~#t832~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t832~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t832~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t832~0.base_13|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t832~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t832~0.base_13|) |v_ULTIMATE.start_main_~#t832~0.offset_11| 3)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t832~0.base=|v_ULTIMATE.start_main_~#t832~0.base_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t832~0.offset=|v_ULTIMATE.start_main_~#t832~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t832~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t832~0.offset, #length] because there is no mapped edge [2019-12-27 02:15:29,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] P3ENTRY-->L4-3: Formula: (and (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| 1) (= (mod v_~z$w_buff1_used~0_154 256) 0) (= v_~z$w_buff0~0_62 v_~z$w_buff1~0_45) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6| v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8) (= v_~z$w_buff0_used~0_302 v_~z$w_buff1_used~0_154) (= 2 v_~z$w_buff0~0_61) (= v_P3Thread1of1ForFork3_~arg.offset_6 |v_P3Thread1of1ForFork3_#in~arg.offset_6|) (= v_P3Thread1of1ForFork3_~arg.base_6 |v_P3Thread1of1ForFork3_#in~arg.base_6|) (= v_~z$w_buff0_used~0_301 1)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_302, ~z$w_buff0~0=v_~z$w_buff0~0_62, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_301, ~z$w_buff0~0=v_~z$w_buff0~0_61, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_6, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_6|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_154, ~z$w_buff1~0=v_~z$w_buff1~0_45, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_6|, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_6, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_6|} AuxVars[] AssignedVars[P3Thread1of1ForFork3___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork3_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression, P3Thread1of1ForFork3_~arg.base] because there is no mapped edge [2019-12-27 02:15:29,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L801-2-->L801-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-629134979 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-629134979 256))) (.cse2 (= |P3Thread1of1ForFork3_#t~ite12_Out-629134979| |P3Thread1of1ForFork3_#t~ite11_Out-629134979|))) (or (and (= ~z$w_buff1~0_In-629134979 |P3Thread1of1ForFork3_#t~ite11_Out-629134979|) (or .cse0 .cse1) .cse2) (and (not .cse1) (= ~z$w_buff0~0_In-629134979 |P3Thread1of1ForFork3_#t~ite11_Out-629134979|) (not .cse0) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-629134979, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-629134979, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-629134979, ~z$w_buff1~0=~z$w_buff1~0_In-629134979} OutVars{~z$w_buff0~0=~z$w_buff0~0_In-629134979, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-629134979, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-629134979|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-629134979, ~z$w_buff1~0=~z$w_buff1~0_In-629134979, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out-629134979|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12, P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 02:15:29,267 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L806-->L807: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_42 256))) (= v_~z$r_buff0_thd4~0_99 v_~z$r_buff0_thd4~0_100)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_42} OutVars{P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_9|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_7|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_11|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_99, ~weak$$choice2~0=v_~weak$$choice2~0_42} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 02:15:29,269 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L809-->L809-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-434037925 256) 0))) (or (and (= ~z~0_In-434037925 |P3Thread1of1ForFork3_#t~ite31_Out-434037925|) .cse0) (and (not .cse0) (= ~z$mem_tmp~0_In-434037925 |P3Thread1of1ForFork3_#t~ite31_Out-434037925|)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-434037925, ~z$flush_delayed~0=~z$flush_delayed~0_In-434037925, ~z~0=~z~0_In-434037925} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-434037925, ~z$flush_delayed~0=~z$flush_delayed~0_In-434037925, ~z~0=~z~0_In-434037925, P3Thread1of1ForFork3_#t~ite31=|P3Thread1of1ForFork3_#t~ite31_Out-434037925|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 02:15:29,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~a~0_21 1) (= v_~x~0_33 1) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_P0Thread1of1ForFork0_~arg.base_18 |v_P0Thread1of1ForFork0_#in~arg.base_18|) (= v_P0Thread1of1ForFork0_~arg.offset_18 |v_P0Thread1of1ForFork0_#in~arg.offset_18|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} OutVars{~a~0=v_~a~0_21, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_18|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_18|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_18, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_18} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 02:15:29,272 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1054] [1054] P1ENTRY-->P1EXIT: Formula: (and (= v_~x~0_54 2) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_83 1) (= v_~__unbuffered_cnt~0_140 (+ v_~__unbuffered_cnt~0_141 1)) (= |v_P1Thread1of1ForFork1_#in~arg.offset_14| v_P1Thread1of1ForFork1_~arg.offset_14) (= v_P1Thread1of1ForFork1_~arg.base_14 |v_P1Thread1of1ForFork1_#in~arg.base_14|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_141} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_14, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_14, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_14|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_14|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~y~0=v_~y~0_83, ~x~0=v_~x~0_54, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:15:29,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L770-2-->L770-5: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1644052662 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1644052662 256))) (.cse1 (= |P2Thread1of1ForFork2_#t~ite4_Out-1644052662| |P2Thread1of1ForFork2_#t~ite3_Out-1644052662|))) (or (and (not .cse0) (= ~z$w_buff1~0_In-1644052662 |P2Thread1of1ForFork2_#t~ite3_Out-1644052662|) .cse1 (not .cse2)) (and (= ~z~0_In-1644052662 |P2Thread1of1ForFork2_#t~ite3_Out-1644052662|) (or .cse2 .cse0) .cse1))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1644052662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1644052662, ~z$w_buff1~0=~z$w_buff1~0_In-1644052662, ~z~0=~z~0_In-1644052662} OutVars{P2Thread1of1ForFork2_#t~ite4=|P2Thread1of1ForFork2_#t~ite4_Out-1644052662|, P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-1644052662|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1644052662, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1644052662, ~z$w_buff1~0=~z$w_buff1~0_In-1644052662, ~z~0=~z~0_In-1644052662} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 02:15:29,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L771-->L771-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In673182223 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In673182223 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In673182223 |P2Thread1of1ForFork2_#t~ite5_Out673182223|)) (and (= |P2Thread1of1ForFork2_#t~ite5_Out673182223| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In673182223, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In673182223} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out673182223|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In673182223, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In673182223} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 02:15:29,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1602297636 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-1602297636 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-1602297636 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1602297636 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite6_Out-1602297636| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite6_Out-1602297636| ~z$w_buff1_used~0_In-1602297636)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1602297636, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1602297636, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1602297636, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1602297636} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1602297636|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1602297636, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1602297636, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1602297636, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1602297636} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 02:15:29,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L773-->L773-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In637697712 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In637697712 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite7_Out637697712| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In637697712 |P2Thread1of1ForFork2_#t~ite7_Out637697712|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In637697712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In637697712} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In637697712, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In637697712, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out637697712|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 02:15:29,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In614197751 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In614197751 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In614197751 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In614197751 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out614197751|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~z$r_buff1_thd3~0_In614197751 |P2Thread1of1ForFork2_#t~ite8_Out614197751|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In614197751, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In614197751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614197751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In614197751} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In614197751, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In614197751, ~z$w_buff1_used~0=~z$w_buff1_used~0_In614197751, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In614197751, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out614197751|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:15:29,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_111 1) v_~__unbuffered_cnt~0_110) (= |v_P2Thread1of1ForFork2_#t~ite8_54| v_~z$r_buff1_thd3~0_177) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_111, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_54|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_177, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_110, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_53|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 02:15:29,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L817-->L817-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1126203014 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1126203014 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite34_Out1126203014| ~z$w_buff0_used~0_In1126203014)) (and (= |P3Thread1of1ForFork3_#t~ite34_Out1126203014| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1126203014, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1126203014} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1126203014, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1126203014, P3Thread1of1ForFork3_#t~ite34=|P3Thread1of1ForFork3_#t~ite34_Out1126203014|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite34] because there is no mapped edge [2019-12-27 02:15:29,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In612278878 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In612278878 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In612278878 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In612278878 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite35_Out612278878|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In612278878 |P3Thread1of1ForFork3_#t~ite35_Out612278878|) (or .cse3 .cse2)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In612278878, ~z$w_buff0_used~0=~z$w_buff0_used~0_In612278878, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In612278878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In612278878} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In612278878, ~z$w_buff0_used~0=~z$w_buff0_used~0_In612278878, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In612278878, ~z$w_buff1_used~0=~z$w_buff1_used~0_In612278878, P3Thread1of1ForFork3_#t~ite35=|P3Thread1of1ForFork3_#t~ite35_Out612278878|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite35] because there is no mapped edge [2019-12-27 02:15:29,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L819-->L820: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-329745375 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-329745375 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd4~0_Out-329745375 0)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out-329745375 ~z$r_buff0_thd4~0_In-329745375)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-329745375, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-329745375} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-329745375, P3Thread1of1ForFork3_#t~ite36=|P3Thread1of1ForFork3_#t~ite36_Out-329745375|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-329745375} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite36, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-27 02:15:29,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L820-->L820-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1616785322 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1616785322 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1616785322 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1616785322 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd4~0_In-1616785322 |P3Thread1of1ForFork3_#t~ite37_Out-1616785322|)) (and (= 0 |P3Thread1of1ForFork3_#t~ite37_Out-1616785322|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1616785322, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1616785322, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1616785322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1616785322} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1616785322, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1616785322, P3Thread1of1ForFork3_#t~ite37=|P3Thread1of1ForFork3_#t~ite37_Out-1616785322|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1616785322, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1616785322} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite37] because there is no mapped edge [2019-12-27 02:15:29,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1052] [1052] L820-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite37_52| v_~z$r_buff1_thd4~0_255) (= v_~__unbuffered_cnt~0_134 (+ v_~__unbuffered_cnt~0_135 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_52|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_135} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_255, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_51|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_134, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 02:15:29,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L845-1-->L851: Formula: (and (= 4 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~nondet41=|v_ULTIMATE.start_main_#t~nondet41_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~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:15:29,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L851-2-->L851-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In983888494 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In983888494 256)))) (or (and (= ~z$w_buff1~0_In983888494 |ULTIMATE.start_main_#t~ite42_Out983888494|) (not .cse0) (not .cse1)) (and (= ~z~0_In983888494 |ULTIMATE.start_main_#t~ite42_Out983888494|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In983888494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983888494, ~z$w_buff1~0=~z$w_buff1~0_In983888494, ~z~0=~z~0_In983888494} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In983888494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In983888494, ~z$w_buff1~0=~z$w_buff1~0_In983888494, ~z~0=~z~0_In983888494, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out983888494|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:15:29,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L851-4-->L852: Formula: (= v_~z~0_85 |v_ULTIMATE.start_main_#t~ite42_10|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|} OutVars{~z~0=v_~z~0_85, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_9|} AuxVars[] AssignedVars[~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 02:15:29,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L852-->L852-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-627280806 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-627280806 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-627280806| ~z$w_buff0_used~0_In-627280806) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-627280806| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-627280806, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-627280806} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-627280806, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-627280806, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-627280806|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 02:15:29,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-115122865 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-115122865 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In-115122865 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-115122865 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-115122865| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-115122865 |ULTIMATE.start_main_#t~ite45_Out-115122865|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-115122865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-115122865, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-115122865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-115122865} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-115122865, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-115122865, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-115122865, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-115122865, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-115122865|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 02:15:29,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1188090509 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In-1188090509 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-1188090509| ~z$r_buff0_thd0~0_In-1188090509)) (and (= |ULTIMATE.start_main_#t~ite46_Out-1188090509| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1188090509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1188090509} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1188090509, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1188090509, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-1188090509|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 02:15:29,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L855-->L855-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-22103115 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-22103115 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In-22103115 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-22103115 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-22103115 |ULTIMATE.start_main_#t~ite47_Out-22103115|)) (and (= |ULTIMATE.start_main_#t~ite47_Out-22103115| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-22103115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-22103115, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-22103115, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-22103115} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-22103115, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-22103115, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-22103115, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-22103115|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-22103115} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 02:15:29,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L870-->L870-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1790734568 256)))) (or (and (= |ULTIMATE.start_main_#t~ite70_Out-1790734568| ~z$mem_tmp~0_In-1790734568) (not .cse0)) (and .cse0 (= |ULTIMATE.start_main_#t~ite70_Out-1790734568| ~z~0_In-1790734568)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1790734568, ~z$flush_delayed~0=~z$flush_delayed~0_In-1790734568, ~z~0=~z~0_In-1790734568} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1790734568, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-1790734568|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1790734568, ~z~0=~z~0_In-1790734568} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-27 02:15:29,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 0) (= 0 v_~z$flush_delayed~0_270) (= v_~z~0_292 |v_ULTIMATE.start_main_#t~ite70_48|) (= (mod v_~main$tmp_guard1~0_61 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_48|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_270, ~z~0=v_~z~0_292, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite70, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:15:29,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:15:29 BasicIcfg [2019-12-27 02:15:29,458 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:15:29,460 INFO L168 Benchmark]: Toolchain (without parser) took 73000.40 ms. Allocated memory was 145.2 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 101.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:15:29,460 INFO L168 Benchmark]: CDTParser took 0.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 02:15:29,461 INFO L168 Benchmark]: CACSL2BoogieTranslator took 862.31 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 154.5 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:29,462 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.64 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 150.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:29,462 INFO L168 Benchmark]: Boogie Preprocessor took 56.05 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 147.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:29,463 INFO L168 Benchmark]: RCFGBuilder took 1024.23 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 147.9 MB in the beginning and 203.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. [2019-12-27 02:15:29,464 INFO L168 Benchmark]: TraceAbstraction took 70973.36 ms. Allocated memory was 235.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-27 02:15:29,467 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.73 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 862.31 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.9 MB in the beginning and 154.5 MB in the end (delta: -53.5 MB). Peak memory consumption was 22.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.64 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 150.5 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.05 ms. Allocated memory is still 202.4 MB. Free memory was 150.5 MB in the beginning and 147.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1024.23 ms. Allocated memory was 202.4 MB in the beginning and 235.4 MB in the end (delta: 33.0 MB). Free memory was 147.9 MB in the beginning and 203.9 MB in the end (delta: -56.0 MB). Peak memory consumption was 66.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70973.36 ms. Allocated memory was 235.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.1s, 221 ProgramPointsBefore, 122 ProgramPointsAfterwards, 270 TransitionsBefore, 142 TransitionsAfterwards, 28796 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 34 ChoiceCompositions, 10428 VarBasedMoverChecksPositive, 374 VarBasedMoverChecksNegative, 122 SemBasedMoverChecksPositive, 390 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.4s, 0 MoverChecksTotal, 145015 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L839] FCALL, FORK 0 pthread_create(&t829, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t830, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t831, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t832, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L794] 4 z$r_buff0_thd4 = (_Bool)1 [L797] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 4 z$flush_delayed = weak$$choice2 [L800] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L802] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z = z$flush_delayed ? z$mem_tmp : z [L810] 4 z$flush_delayed = (_Bool)0 [L813] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L818] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 z$flush_delayed = weak$$choice2 [L861] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L865] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 209 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.5s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2745 SDtfs, 2842 SDslu, 5998 SDs, 0 SdLazy, 1965 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 28 SyntacticMatches, 7 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160294occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 34.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 8881 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 836 ConstructedInterpolants, 0 QuantifiedInterpolants, 189680 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...