/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:24:28,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:24:28,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:24:28,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:24:28,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:24:28,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:24:28,189 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:24:28,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:24:28,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:24:28,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:24:28,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:24:28,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:24:28,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:24:28,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:24:28,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:24:28,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:24:28,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:24:28,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:24:28,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:24:28,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:24:28,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:24:28,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:24:28,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:24:28,234 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:24:28,236 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:24:28,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:24:28,237 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:24:28,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:24:28,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:24:28,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:24:28,241 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:24:28,241 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:24:28,242 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:24:28,243 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:24:28,244 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:24:28,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:24:28,245 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:24:28,245 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:24:28,246 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:24:28,246 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:24:28,248 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:24:28,248 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-18 21:24:28,275 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:24:28,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:24:28,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:24:28,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:24:28,277 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:24:28,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:24:28,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:24:28,277 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:24:28,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:24:28,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:24:28,278 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:24:28,278 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:24:28,278 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:24:28,279 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:24:28,279 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:24:28,279 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:24:28,279 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:24:28,279 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:24:28,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:24:28,280 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:24:28,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:24:28,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:24:28,280 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:24:28,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:24:28,281 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:24:28,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:24:28,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:24:28,281 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:24:28,281 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:24:28,282 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:24:28,561 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:24:28,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:24:28,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:24:28,586 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:24:28,586 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:24:28,587 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-18 21:24:28,658 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc96f0de/6997f05edd784ee29d5755ec8173d79b/FLAG2f7d465a0 [2019-12-18 21:24:29,192 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:24:29,193 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_pso.opt.i [2019-12-18 21:24:29,209 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc96f0de/6997f05edd784ee29d5755ec8173d79b/FLAG2f7d465a0 [2019-12-18 21:24:29,515 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc96f0de/6997f05edd784ee29d5755ec8173d79b [2019-12-18 21:24:29,525 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:24:29,526 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:24:29,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:24:29,528 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:24:29,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:24:29,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:29" (1/1) ... [2019-12-18 21:24:29,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56133e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:29, skipping insertion in model container [2019-12-18 21:24:29,536 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:24:29" (1/1) ... [2019-12-18 21:24:29,542 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:24:29,595 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:24:30,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:24:30,159 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:24:30,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:24:30,323 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:24:30,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30 WrapperNode [2019-12-18 21:24:30,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:24:30,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:24:30,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:24:30,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:24:30,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:24:30,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:24:30,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:24:30,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:24:30,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,410 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... [2019-12-18 21:24:30,434 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:24:30,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:24:30,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:24:30,435 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:24:30,436 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:24:30,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:24:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:24:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:24:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:24:30,507 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:24:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:24:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:24:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:24:30,508 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:24:30,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:24:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:24:30,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:24:30,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:24:30,511 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 21:24:31,289 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:24:31,290 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:24:31,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:31 BoogieIcfgContainer [2019-12-18 21:24:31,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:24:31,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:24:31,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:24:31,296 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:24:31,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:24:29" (1/3) ... [2019-12-18 21:24:31,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c7fa9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:31, skipping insertion in model container [2019-12-18 21:24:31,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:24:30" (2/3) ... [2019-12-18 21:24:31,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c7fa9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:24:31, skipping insertion in model container [2019-12-18 21:24:31,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:24:31" (3/3) ... [2019-12-18 21:24:31,304 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_pso.opt.i [2019-12-18 21:24:31,315 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:24:31,315 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:24:31,324 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:24:31,325 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:24:31,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,362 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,364 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,364 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,365 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,365 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,366 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,373 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,374 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,374 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,374 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,375 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,386 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,387 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,405 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,406 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,406 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,407 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,407 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,408 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,408 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,410 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,411 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:24:31,425 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 21:24:31,446 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:24:31,446 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:24:31,447 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:24:31,447 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:24:31,447 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:24:31,447 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:24:31,447 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:24:31,447 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:24:31,470 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 165 places, 196 transitions [2019-12-18 21:24:31,473 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 21:24:31,559 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 21:24:31,560 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:24:31,584 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:24:31,604 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 165 places, 196 transitions [2019-12-18 21:24:31,662 INFO L126 PetriNetUnfolder]: 41/193 cut-off events. [2019-12-18 21:24:31,662 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:24:31,668 INFO L76 FinitePrefix]: Finished finitePrefix Result has 203 conditions, 193 events. 41/193 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 265 event pairs. 9/159 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-18 21:24:31,683 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-18 21:24:31,684 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:24:35,277 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-18 21:24:35,441 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-18 21:24:35,459 INFO L206 etLargeBlockEncoding]: Checked pairs total: 50879 [2019-12-18 21:24:35,459 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-18 21:24:35,462 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 79 places, 85 transitions [2019-12-18 21:24:36,342 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 14254 states. [2019-12-18 21:24:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 14254 states. [2019-12-18 21:24:36,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 21:24:36,350 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:36,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:36,351 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:36,358 INFO L82 PathProgramCache]: Analyzing trace with hash -632784469, now seen corresponding path program 1 times [2019-12-18 21:24:36,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:36,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047354084] [2019-12-18 21:24:36,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:36,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:36,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:36,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047354084] [2019-12-18 21:24:36,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:36,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:24:36,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84504199] [2019-12-18 21:24:36,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:36,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:36,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:36,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:36,645 INFO L87 Difference]: Start difference. First operand 14254 states. Second operand 3 states. [2019-12-18 21:24:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:37,040 INFO L93 Difference]: Finished difference Result 14182 states and 52796 transitions. [2019-12-18 21:24:37,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:37,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 21:24:37,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:37,239 INFO L225 Difference]: With dead ends: 14182 [2019-12-18 21:24:37,239 INFO L226 Difference]: Without dead ends: 13870 [2019-12-18 21:24:37,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13870 states. [2019-12-18 21:24:38,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13870 to 13870. [2019-12-18 21:24:38,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13870 states. [2019-12-18 21:24:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13870 states to 13870 states and 51678 transitions. [2019-12-18 21:24:38,110 INFO L78 Accepts]: Start accepts. Automaton has 13870 states and 51678 transitions. Word has length 7 [2019-12-18 21:24:38,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:38,111 INFO L462 AbstractCegarLoop]: Abstraction has 13870 states and 51678 transitions. [2019-12-18 21:24:38,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:38,112 INFO L276 IsEmpty]: Start isEmpty. Operand 13870 states and 51678 transitions. [2019-12-18 21:24:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:24:38,116 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:38,116 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:38,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:38,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1056225825, now seen corresponding path program 1 times [2019-12-18 21:24:38,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:38,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204427684] [2019-12-18 21:24:38,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:38,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:38,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:38,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204427684] [2019-12-18 21:24:38,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:38,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:38,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409267888] [2019-12-18 21:24:38,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:38,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:38,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:38,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:38,884 INFO L87 Difference]: Start difference. First operand 13870 states and 51678 transitions. Second operand 4 states. [2019-12-18 21:24:39,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:39,418 INFO L93 Difference]: Finished difference Result 19034 states and 68884 transitions. [2019-12-18 21:24:39,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:39,418 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:24:39,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:39,542 INFO L225 Difference]: With dead ends: 19034 [2019-12-18 21:24:39,543 INFO L226 Difference]: Without dead ends: 19034 [2019-12-18 21:24:39,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:39,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19034 states. [2019-12-18 21:24:40,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19034 to 18800. [2019-12-18 21:24:40,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18800 states. [2019-12-18 21:24:40,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18800 states to 18800 states and 68123 transitions. [2019-12-18 21:24:40,388 INFO L78 Accepts]: Start accepts. Automaton has 18800 states and 68123 transitions. Word has length 13 [2019-12-18 21:24:40,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:40,388 INFO L462 AbstractCegarLoop]: Abstraction has 18800 states and 68123 transitions. [2019-12-18 21:24:40,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:24:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 18800 states and 68123 transitions. [2019-12-18 21:24:40,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 21:24:40,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:40,391 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:40,391 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:40,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:40,392 INFO L82 PathProgramCache]: Analyzing trace with hash 746093816, now seen corresponding path program 1 times [2019-12-18 21:24:40,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:40,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323413412] [2019-12-18 21:24:40,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:40,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323413412] [2019-12-18 21:24:40,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:40,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:40,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312692067] [2019-12-18 21:24:40,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:40,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:40,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:40,489 INFO L87 Difference]: Start difference. First operand 18800 states and 68123 transitions. Second operand 4 states. [2019-12-18 21:24:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:41,023 INFO L93 Difference]: Finished difference Result 27022 states and 95920 transitions. [2019-12-18 21:24:41,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:41,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 21:24:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:41,151 INFO L225 Difference]: With dead ends: 27022 [2019-12-18 21:24:41,151 INFO L226 Difference]: Without dead ends: 27008 [2019-12-18 21:24:41,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:41,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-12-18 21:24:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 22014. [2019-12-18 21:24:41,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22014 states. [2019-12-18 21:24:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22014 states to 22014 states and 79478 transitions. [2019-12-18 21:24:42,045 INFO L78 Accepts]: Start accepts. Automaton has 22014 states and 79478 transitions. Word has length 13 [2019-12-18 21:24:42,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:42,045 INFO L462 AbstractCegarLoop]: Abstraction has 22014 states and 79478 transitions. [2019-12-18 21:24:42,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:24:42,046 INFO L276 IsEmpty]: Start isEmpty. Operand 22014 states and 79478 transitions. [2019-12-18 21:24:42,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 21:24:42,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:42,053 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:42,053 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:42,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:42,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1347005908, now seen corresponding path program 1 times [2019-12-18 21:24:42,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:42,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190316331] [2019-12-18 21:24:42,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:42,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:42,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190316331] [2019-12-18 21:24:42,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:42,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:24:42,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980829314] [2019-12-18 21:24:42,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:24:42,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:42,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:24:42,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:42,160 INFO L87 Difference]: Start difference. First operand 22014 states and 79478 transitions. Second operand 5 states. [2019-12-18 21:24:42,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:42,720 INFO L93 Difference]: Finished difference Result 29780 states and 105415 transitions. [2019-12-18 21:24:42,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:24:42,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 21:24:42,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:42,826 INFO L225 Difference]: With dead ends: 29780 [2019-12-18 21:24:42,826 INFO L226 Difference]: Without dead ends: 29766 [2019-12-18 21:24:42,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:24:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29766 states. [2019-12-18 21:24:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29766 to 21918. [2019-12-18 21:24:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21918 states. [2019-12-18 21:24:44,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21918 states to 21918 states and 78970 transitions. [2019-12-18 21:24:44,742 INFO L78 Accepts]: Start accepts. Automaton has 21918 states and 78970 transitions. Word has length 19 [2019-12-18 21:24:44,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:44,743 INFO L462 AbstractCegarLoop]: Abstraction has 21918 states and 78970 transitions. [2019-12-18 21:24:44,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:24:44,743 INFO L276 IsEmpty]: Start isEmpty. Operand 21918 states and 78970 transitions. [2019-12-18 21:24:44,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 21:24:44,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:44,779 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] [2019-12-18 21:24:44,779 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:44,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:44,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1048489812, now seen corresponding path program 1 times [2019-12-18 21:24:44,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:44,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716597299] [2019-12-18 21:24:44,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:44,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716597299] [2019-12-18 21:24:44,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:44,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:24:44,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004970884] [2019-12-18 21:24:44,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:24:44,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:44,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:24:44,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:24:44,977 INFO L87 Difference]: Start difference. First operand 21918 states and 78970 transitions. Second operand 6 states. [2019-12-18 21:24:45,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:45,605 INFO L93 Difference]: Finished difference Result 32226 states and 113712 transitions. [2019-12-18 21:24:45,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 21:24:45,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 21:24:45,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:45,679 INFO L225 Difference]: With dead ends: 32226 [2019-12-18 21:24:45,680 INFO L226 Difference]: Without dead ends: 32194 [2019-12-18 21:24:45,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:24:45,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32194 states. [2019-12-18 21:24:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32194 to 27516. [2019-12-18 21:24:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27516 states. [2019-12-18 21:24:46,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27516 states to 27516 states and 97909 transitions. [2019-12-18 21:24:46,774 INFO L78 Accepts]: Start accepts. Automaton has 27516 states and 97909 transitions. Word has length 27 [2019-12-18 21:24:46,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:46,774 INFO L462 AbstractCegarLoop]: Abstraction has 27516 states and 97909 transitions. [2019-12-18 21:24:46,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:24:46,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27516 states and 97909 transitions. [2019-12-18 21:24:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:24:46,825 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:46,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:46,825 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:46,826 INFO L82 PathProgramCache]: Analyzing trace with hash -386322379, now seen corresponding path program 1 times [2019-12-18 21:24:46,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:46,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529242809] [2019-12-18 21:24:46,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:46,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529242809] [2019-12-18 21:24:46,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:46,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:24:46,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348135427] [2019-12-18 21:24:46,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:46,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:46,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:46,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:46,929 INFO L87 Difference]: Start difference. First operand 27516 states and 97909 transitions. Second operand 3 states. [2019-12-18 21:24:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:47,104 INFO L93 Difference]: Finished difference Result 34788 states and 124357 transitions. [2019-12-18 21:24:47,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:47,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 21:24:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:47,172 INFO L225 Difference]: With dead ends: 34788 [2019-12-18 21:24:47,172 INFO L226 Difference]: Without dead ends: 34788 [2019-12-18 21:24:47,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:47,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34788 states. [2019-12-18 21:24:48,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34788 to 30668. [2019-12-18 21:24:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-18 21:24:49,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 110245 transitions. [2019-12-18 21:24:49,057 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 110245 transitions. Word has length 33 [2019-12-18 21:24:49,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:49,057 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 110245 transitions. [2019-12-18 21:24:49,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 110245 transitions. [2019-12-18 21:24:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:24:49,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:49,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:49,093 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:49,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1183375097, now seen corresponding path program 1 times [2019-12-18 21:24:49,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:49,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180629437] [2019-12-18 21:24:49,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:49,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:49,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:49,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180629437] [2019-12-18 21:24:49,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:49,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:49,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103171063] [2019-12-18 21:24:49,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:49,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:49,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:49,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:49,153 INFO L87 Difference]: Start difference. First operand 30668 states and 110245 transitions. Second operand 3 states. [2019-12-18 21:24:49,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:49,366 INFO L93 Difference]: Finished difference Result 30668 states and 109909 transitions. [2019-12-18 21:24:49,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:49,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 21:24:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:49,711 INFO L225 Difference]: With dead ends: 30668 [2019-12-18 21:24:49,712 INFO L226 Difference]: Without dead ends: 30668 [2019-12-18 21:24:49,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30668 states. [2019-12-18 21:24:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30668 to 30668. [2019-12-18 21:24:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30668 states. [2019-12-18 21:24:50,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30668 states to 30668 states and 109909 transitions. [2019-12-18 21:24:50,247 INFO L78 Accepts]: Start accepts. Automaton has 30668 states and 109909 transitions. Word has length 33 [2019-12-18 21:24:50,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:50,248 INFO L462 AbstractCegarLoop]: Abstraction has 30668 states and 109909 transitions. [2019-12-18 21:24:50,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:50,248 INFO L276 IsEmpty]: Start isEmpty. Operand 30668 states and 109909 transitions. [2019-12-18 21:24:50,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:24:50,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:50,276 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:50,277 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:50,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:50,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1422326855, now seen corresponding path program 1 times [2019-12-18 21:24:50,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:50,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735269528] [2019-12-18 21:24:50,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:50,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:50,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735269528] [2019-12-18 21:24:50,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:50,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:24:50,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350641927] [2019-12-18 21:24:50,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:24:50,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:50,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:24:50,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:24:50,371 INFO L87 Difference]: Start difference. First operand 30668 states and 109909 transitions. Second operand 7 states. [2019-12-18 21:24:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:52,201 INFO L93 Difference]: Finished difference Result 47574 states and 166546 transitions. [2019-12-18 21:24:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 21:24:52,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:24:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:52,352 INFO L225 Difference]: With dead ends: 47574 [2019-12-18 21:24:52,352 INFO L226 Difference]: Without dead ends: 47534 [2019-12-18 21:24:52,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-18 21:24:52,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47534 states. [2019-12-18 21:24:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47534 to 31416. [2019-12-18 21:24:53,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31416 states. [2019-12-18 21:24:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31416 states to 31416 states and 112497 transitions. [2019-12-18 21:24:53,381 INFO L78 Accepts]: Start accepts. Automaton has 31416 states and 112497 transitions. Word has length 33 [2019-12-18 21:24:53,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:53,381 INFO L462 AbstractCegarLoop]: Abstraction has 31416 states and 112497 transitions. [2019-12-18 21:24:53,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:24:53,381 INFO L276 IsEmpty]: Start isEmpty. Operand 31416 states and 112497 transitions. [2019-12-18 21:24:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:24:53,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:53,409 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:53,409 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:53,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash 147370621, now seen corresponding path program 1 times [2019-12-18 21:24:53,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:53,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023372689] [2019-12-18 21:24:53,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:53,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:53,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023372689] [2019-12-18 21:24:53,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:53,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:24:53,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240824599] [2019-12-18 21:24:53,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 21:24:53,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:53,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 21:24:53,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:24:53,499 INFO L87 Difference]: Start difference. First operand 31416 states and 112497 transitions. Second operand 7 states. [2019-12-18 21:24:54,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:54,348 INFO L93 Difference]: Finished difference Result 44276 states and 155683 transitions. [2019-12-18 21:24:54,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:24:54,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 21:24:54,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:54,433 INFO L225 Difference]: With dead ends: 44276 [2019-12-18 21:24:54,433 INFO L226 Difference]: Without dead ends: 44250 [2019-12-18 21:24:54,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-12-18 21:24:54,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44250 states. [2019-12-18 21:24:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44250 to 35296. [2019-12-18 21:24:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35296 states. [2019-12-18 21:24:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35296 states to 35296 states and 125497 transitions. [2019-12-18 21:24:55,485 INFO L78 Accepts]: Start accepts. Automaton has 35296 states and 125497 transitions. Word has length 33 [2019-12-18 21:24:55,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:55,486 INFO L462 AbstractCegarLoop]: Abstraction has 35296 states and 125497 transitions. [2019-12-18 21:24:55,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 21:24:55,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35296 states and 125497 transitions. [2019-12-18 21:24:55,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 21:24:55,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:55,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:55,512 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:55,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:55,512 INFO L82 PathProgramCache]: Analyzing trace with hash 528874148, now seen corresponding path program 1 times [2019-12-18 21:24:55,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:55,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010886761] [2019-12-18 21:24:55,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:55,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:55,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:55,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010886761] [2019-12-18 21:24:55,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:55,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:24:55,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574902070] [2019-12-18 21:24:55,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:24:55,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:55,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:24:55,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:24:55,591 INFO L87 Difference]: Start difference. First operand 35296 states and 125497 transitions. Second operand 4 states. [2019-12-18 21:24:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:55,676 INFO L93 Difference]: Finished difference Result 20235 states and 61968 transitions. [2019-12-18 21:24:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:24:55,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-18 21:24:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:55,703 INFO L225 Difference]: With dead ends: 20235 [2019-12-18 21:24:55,703 INFO L226 Difference]: Without dead ends: 19705 [2019-12-18 21:24:55,703 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-18 21:24:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19705 states. [2019-12-18 21:24:55,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19705 to 19705. [2019-12-18 21:24:55,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19705 states. [2019-12-18 21:24:56,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19705 states to 19705 states and 60462 transitions. [2019-12-18 21:24:56,015 INFO L78 Accepts]: Start accepts. Automaton has 19705 states and 60462 transitions. Word has length 33 [2019-12-18 21:24:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:56,015 INFO L462 AbstractCegarLoop]: Abstraction has 19705 states and 60462 transitions. [2019-12-18 21:24:56,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:24:56,016 INFO L276 IsEmpty]: Start isEmpty. Operand 19705 states and 60462 transitions. [2019-12-18 21:24:56,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 21:24:56,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:56,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:56,034 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1883155701, now seen corresponding path program 1 times [2019-12-18 21:24:56,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:56,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236696887] [2019-12-18 21:24:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:56,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236696887] [2019-12-18 21:24:56,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:56,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:24:56,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733658482] [2019-12-18 21:24:56,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:24:56,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:56,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:24:56,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:56,130 INFO L87 Difference]: Start difference. First operand 19705 states and 60462 transitions. Second operand 5 states. [2019-12-18 21:24:56,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:56,180 INFO L93 Difference]: Finished difference Result 2732 states and 6358 transitions. [2019-12-18 21:24:56,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:24:56,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-12-18 21:24:56,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:56,184 INFO L225 Difference]: With dead ends: 2732 [2019-12-18 21:24:56,184 INFO L226 Difference]: Without dead ends: 2423 [2019-12-18 21:24:56,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:24:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2019-12-18 21:24:56,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2423. [2019-12-18 21:24:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-18 21:24:56,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 5497 transitions. [2019-12-18 21:24:56,218 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 5497 transitions. Word has length 34 [2019-12-18 21:24:56,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:56,219 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 5497 transitions. [2019-12-18 21:24:56,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:24:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 5497 transitions. [2019-12-18 21:24:56,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-18 21:24:56,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:56,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:24:56,223 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:56,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:56,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1551487306, now seen corresponding path program 1 times [2019-12-18 21:24:56,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:56,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909379104] [2019-12-18 21:24:56,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:56,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:56,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909379104] [2019-12-18 21:24:56,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:56,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:24:56,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580567570] [2019-12-18 21:24:56,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:24:56,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:56,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:24:56,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:24:56,362 INFO L87 Difference]: Start difference. First operand 2423 states and 5497 transitions. Second operand 6 states. [2019-12-18 21:24:56,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:56,425 INFO L93 Difference]: Finished difference Result 706 states and 1597 transitions. [2019-12-18 21:24:56,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:24:56,425 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-12-18 21:24:56,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:56,426 INFO L225 Difference]: With dead ends: 706 [2019-12-18 21:24:56,426 INFO L226 Difference]: Without dead ends: 660 [2019-12-18 21:24:56,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 21:24:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-12-18 21:24:56,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 604. [2019-12-18 21:24:56,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 21:24:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1375 transitions. [2019-12-18 21:24:56,435 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1375 transitions. Word has length 45 [2019-12-18 21:24:56,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:56,435 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1375 transitions. [2019-12-18 21:24:56,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:24:56,436 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1375 transitions. [2019-12-18 21:24:56,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:24:56,437 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:56,437 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] [2019-12-18 21:24:56,438 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:56,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1913212359, now seen corresponding path program 1 times [2019-12-18 21:24:56,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:56,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478585866] [2019-12-18 21:24:56,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:56,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:56,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478585866] [2019-12-18 21:24:56,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:56,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:24:56,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237752500] [2019-12-18 21:24:56,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:24:56,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:56,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:24:56,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:24:56,552 INFO L87 Difference]: Start difference. First operand 604 states and 1375 transitions. Second operand 5 states. [2019-12-18 21:24:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:56,774 INFO L93 Difference]: Finished difference Result 875 states and 2004 transitions. [2019-12-18 21:24:56,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:24:56,774 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 56 [2019-12-18 21:24:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:56,776 INFO L225 Difference]: With dead ends: 875 [2019-12-18 21:24:56,776 INFO L226 Difference]: Without dead ends: 875 [2019-12-18 21:24:56,777 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-18 21:24:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2019-12-18 21:24:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 640. [2019-12-18 21:24:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2019-12-18 21:24:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1467 transitions. [2019-12-18 21:24:56,789 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1467 transitions. Word has length 56 [2019-12-18 21:24:56,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:56,789 INFO L462 AbstractCegarLoop]: Abstraction has 640 states and 1467 transitions. [2019-12-18 21:24:56,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:24:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1467 transitions. [2019-12-18 21:24:56,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-18 21:24:56,791 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:56,791 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] [2019-12-18 21:24:56,791 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:56,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:56,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1265963483, now seen corresponding path program 2 times [2019-12-18 21:24:56,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:56,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136144547] [2019-12-18 21:24:56,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:56,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136144547] [2019-12-18 21:24:56,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:56,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:24:56,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651484101] [2019-12-18 21:24:56,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:24:56,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:56,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:24:56,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:56,966 INFO L87 Difference]: Start difference. First operand 640 states and 1467 transitions. Second operand 3 states. [2019-12-18 21:24:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:56,980 INFO L93 Difference]: Finished difference Result 640 states and 1437 transitions. [2019-12-18 21:24:56,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:24:56,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-18 21:24:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:56,982 INFO L225 Difference]: With dead ends: 640 [2019-12-18 21:24:56,982 INFO L226 Difference]: Without dead ends: 640 [2019-12-18 21:24:56,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:24:56,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-12-18 21:24:56,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 604. [2019-12-18 21:24:56,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-12-18 21:24:56,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1351 transitions. [2019-12-18 21:24:56,992 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1351 transitions. Word has length 56 [2019-12-18 21:24:56,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:56,992 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 1351 transitions. [2019-12-18 21:24:56,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:24:56,992 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1351 transitions. [2019-12-18 21:24:56,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:56,993 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:56,993 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] [2019-12-18 21:24:56,994 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:56,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:56,994 INFO L82 PathProgramCache]: Analyzing trace with hash 748257012, now seen corresponding path program 1 times [2019-12-18 21:24:56,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:56,994 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167725029] [2019-12-18 21:24:56,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:57,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:57,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167725029] [2019-12-18 21:24:57,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:57,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 21:24:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265813914] [2019-12-18 21:24:57,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 21:24:57,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:57,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 21:24:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:24:57,277 INFO L87 Difference]: Start difference. First operand 604 states and 1351 transitions. Second operand 12 states. [2019-12-18 21:24:57,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:57,925 INFO L93 Difference]: Finished difference Result 1224 states and 2430 transitions. [2019-12-18 21:24:57,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:24:57,926 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-18 21:24:57,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:57,927 INFO L225 Difference]: With dead ends: 1224 [2019-12-18 21:24:57,927 INFO L226 Difference]: Without dead ends: 608 [2019-12-18 21:24:57,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:24:57,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-12-18 21:24:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 542. [2019-12-18 21:24:57,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2019-12-18 21:24:57,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1172 transitions. [2019-12-18 21:24:57,936 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1172 transitions. Word has length 57 [2019-12-18 21:24:57,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:57,936 INFO L462 AbstractCegarLoop]: Abstraction has 542 states and 1172 transitions. [2019-12-18 21:24:57,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 21:24:57,936 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1172 transitions. [2019-12-18 21:24:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:57,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:57,937 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] [2019-12-18 21:24:57,937 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1731614154, now seen corresponding path program 2 times [2019-12-18 21:24:57,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:57,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601319854] [2019-12-18 21:24:57,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:58,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601319854] [2019-12-18 21:24:58,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:58,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-18 21:24:58,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404647783] [2019-12-18 21:24:58,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-18 21:24:58,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:58,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-18 21:24:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2019-12-18 21:24:58,403 INFO L87 Difference]: Start difference. First operand 542 states and 1172 transitions. Second operand 18 states. [2019-12-18 21:24:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:24:59,455 INFO L93 Difference]: Finished difference Result 1422 states and 3157 transitions. [2019-12-18 21:24:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 21:24:59,456 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 57 [2019-12-18 21:24:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:24:59,458 INFO L225 Difference]: With dead ends: 1422 [2019-12-18 21:24:59,458 INFO L226 Difference]: Without dead ends: 1392 [2019-12-18 21:24:59,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=779, Unknown=0, NotChecked=0, Total=930 [2019-12-18 21:24:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2019-12-18 21:24:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 704. [2019-12-18 21:24:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 704 states. [2019-12-18 21:24:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1526 transitions. [2019-12-18 21:24:59,469 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1526 transitions. Word has length 57 [2019-12-18 21:24:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:24:59,469 INFO L462 AbstractCegarLoop]: Abstraction has 704 states and 1526 transitions. [2019-12-18 21:24:59,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-18 21:24:59,470 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1526 transitions. [2019-12-18 21:24:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:24:59,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:24:59,471 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] [2019-12-18 21:24:59,471 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:24:59,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:24:59,472 INFO L82 PathProgramCache]: Analyzing trace with hash -2005378302, now seen corresponding path program 3 times [2019-12-18 21:24:59,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:24:59,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640575963] [2019-12-18 21:24:59,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:24:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:24:59,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 21:24:59,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640575963] [2019-12-18 21:24:59,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:24:59,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:24:59,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492553711] [2019-12-18 21:24:59,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:24:59,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:24:59,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:24:59,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:24:59,769 INFO L87 Difference]: Start difference. First operand 704 states and 1526 transitions. Second operand 14 states. [2019-12-18 21:25:00,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:25:00,497 INFO L93 Difference]: Finished difference Result 1174 states and 2552 transitions. [2019-12-18 21:25:00,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 21:25:00,497 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-18 21:25:00,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:25:00,499 INFO L225 Difference]: With dead ends: 1174 [2019-12-18 21:25:00,499 INFO L226 Difference]: Without dead ends: 1144 [2019-12-18 21:25:00,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-18 21:25:00,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1144 states. [2019-12-18 21:25:00,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1144 to 780. [2019-12-18 21:25:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2019-12-18 21:25:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 1708 transitions. [2019-12-18 21:25:00,510 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 1708 transitions. Word has length 57 [2019-12-18 21:25:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:25:00,510 INFO L462 AbstractCegarLoop]: Abstraction has 780 states and 1708 transitions. [2019-12-18 21:25:00,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:25:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 1708 transitions. [2019-12-18 21:25:00,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 21:25:00,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:25:00,511 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] [2019-12-18 21:25:00,512 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:25:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:25:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash -109693258, now seen corresponding path program 4 times [2019-12-18 21:25:00,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:25:00,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757451001] [2019-12-18 21:25:00,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:25:00,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:25:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:25:00,635 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:25:00,635 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:25:00,639 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] ULTIMATE.startENTRY-->L812: Formula: (let ((.cse0 (store |v_#valid_56| 0 0))) (and (= 0 v_~y$r_buff1_thd3~0_21) (= v_~main$tmp_guard0~0_10 0) (= v_~__unbuffered_p0_EAX~0_8 0) (= v_~y$w_buff1_used~0_72 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1114~0.base_27|) (= 0 v_~y$w_buff1~0_27) (= 0 v_~weak$$choice0~0_9) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~y$r_buff0_thd1~0_11 0) (= v_~__unbuffered_p2_EBX~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27|) 0) (= v_~a~0_11 0) (= v_~z~0_11 0) (= v_~main$tmp_guard1~0_11 0) (= v_~y$read_delayed~0_8 0) (= v_~y$w_buff0_used~0_108 0) (= 0 v_~x~0_9) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1114~0.base_27|) |v_ULTIMATE.start_main_~#t1114~0.offset_21| 0)) |v_#memory_int_15|) (= 0 v_~y$r_buff1_thd1~0_10) (= v_~y$r_buff0_thd3~0_28 0) (= 0 v_~y$r_buff1_thd2~0_21) (= v_~y$mem_tmp~0_11 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1114~0.base_27| 4)) (= v_~y$r_buff0_thd0~0_85 0) (= 0 v_~__unbuffered_p2_EAX~0_10) (< 0 |v_#StackHeapBarrier_14|) (= 0 |v_ULTIMATE.start_main_~#t1114~0.offset_21|) (= |v_#valid_54| (store .cse0 |v_ULTIMATE.start_main_~#t1114~0.base_27| 1)) (= 0 v_~weak$$choice2~0_35) (= |v_#NULL.offset_5| 0) (= 0 v_~y$w_buff0~0_27) (= 0 v_~y$read_delayed_var~0.base_8) (= v_~y~0_26 0) (= 0 v_~__unbuffered_cnt~0_18) (= v_~y$r_buff0_thd2~0_22 0) (= 0 |v_#NULL.base_5|) (= 0 v_~y$flush_delayed~0_16) (= 0 v_~y$r_buff1_thd0~0_53))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_56|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_~#t1114~0.offset=|v_ULTIMATE.start_main_~#t1114~0.offset_21|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_14|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_13|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_11|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_14|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_16|, ~y$read_delayed~0=v_~y$read_delayed~0_8, ~a~0=v_~a~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_11, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_21, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_11, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_26|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_10, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_16|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_9|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_16|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_16|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_14|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_14|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_13|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_14|, ~y$w_buff1~0=v_~y$w_buff1~0_27, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_21|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_22, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_10|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_20|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_53, ~x~0=v_~x~0_9, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_108, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_16|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_16|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_13|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_17|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_11|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_10, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_14|, ~y$w_buff0~0=v_~y$w_buff0~0_27, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_28, ~y~0=v_~y~0_26, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_14|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_9|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_14|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_16|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_16|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_14|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_21, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_16|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t1114~0.base=|v_ULTIMATE.start_main_~#t1114~0.base_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_10|, ~z~0=v_~z~0_11, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_72} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1114~0.offset, ULTIMATE.start_main_#t~ite28, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1115~0.base, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ULTIMATE.start_main_~#t1116~0.base, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite30, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_~#t1114~0.base, ULTIMATE.start_main_#t~nondet16, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 21:25:00,640 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L812-1-->L814: Formula: (and (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1115~0.base_9| 4)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1115~0.base_9|) (= |v_ULTIMATE.start_main_~#t1115~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9|) 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1115~0.base_9| 1)) (not (= |v_ULTIMATE.start_main_~#t1115~0.base_9| 0)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1115~0.base_9|) |v_ULTIMATE.start_main_~#t1115~0.offset_8| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, ULTIMATE.start_main_~#t1115~0.offset=|v_ULTIMATE.start_main_~#t1115~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1115~0.base=|v_ULTIMATE.start_main_~#t1115~0.base_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1115~0.offset, #length, ULTIMATE.start_main_~#t1115~0.base] because there is no mapped edge [2019-12-18 21:25:00,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L814-1-->L816: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1116~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10|)) (= |v_ULTIMATE.start_main_~#t1116~0.offset_10| 0) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1116~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1116~0.base_10|) |v_ULTIMATE.start_main_~#t1116~0.offset_10| 2)) |v_#memory_int_11|) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1116~0.base_10| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t1116~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1116~0.base=|v_ULTIMATE.start_main_~#t1116~0.base_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1116~0.offset=|v_ULTIMATE.start_main_~#t1116~0.offset_10|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1116~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t1116~0.offset, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-18 21:25:00,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L4-->L789: Formula: (and (= 1 ~y$r_buff0_thd3~0_Out946081939) (= ~y$r_buff1_thd2~0_Out946081939 ~y$r_buff0_thd2~0_In946081939) (= ~a~0_In946081939 ~__unbuffered_p2_EBX~0_Out946081939) (= ~y$r_buff1_thd3~0_Out946081939 ~y$r_buff0_thd3~0_In946081939) (= 1 ~z~0_Out946081939) (= ~__unbuffered_p2_EAX~0_Out946081939 ~z~0_Out946081939) (not (= 0 P2Thread1of1ForFork1___VERIFIER_assert_~expression_In946081939)) (= ~y$r_buff1_thd0~0_Out946081939 ~y$r_buff0_thd0~0_In946081939) (= ~y$r_buff0_thd1~0_In946081939 ~y$r_buff1_thd1~0_Out946081939)) InVars {~a~0=~a~0_In946081939, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In946081939, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In946081939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In946081939, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In946081939, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In946081939} OutVars{~__unbuffered_p2_EBX~0=~__unbuffered_p2_EBX~0_Out946081939, P2Thread1of1ForFork1___VERIFIER_assert_~expression=P2Thread1of1ForFork1___VERIFIER_assert_~expression_In946081939, ~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out946081939, ~a~0=~a~0_In946081939, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out946081939, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out946081939, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out946081939, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In946081939, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In946081939, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In946081939, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_Out946081939, ~z~0=~z~0_Out946081939, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out946081939} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p2_EBX~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 21:25:00,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork2_~arg.base_4 |v_P0Thread1of1ForFork2_#in~arg.base_4|) (= |v_P0Thread1of1ForFork2_#res.offset_5| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_5|) (= 1 v_~a~0_6) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_5) (= v_P0Thread1of1ForFork2_~arg.offset_4 |v_P0Thread1of1ForFork2_#in~arg.offset_4|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, ~x~0=v_~x~0_5} OutVars{~a~0=v_~a~0_6, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_4|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_4, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_4|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_5|, ~x~0=v_~x~0_5, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_4} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 21:25:00,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L754-2-->L754-5: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In1402893052 256) 0)) (.cse2 (= |P1Thread1of1ForFork0_#t~ite3_Out1402893052| |P1Thread1of1ForFork0_#t~ite4_Out1402893052|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1402893052 256)))) (or (and (or .cse0 .cse1) .cse2 (= |P1Thread1of1ForFork0_#t~ite3_Out1402893052| ~y~0_In1402893052)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite3_Out1402893052| ~y$w_buff1~0_In1402893052) .cse2 (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1402893052, ~y$w_buff1~0=~y$w_buff1~0_In1402893052, ~y~0=~y~0_In1402893052, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1402893052} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1402893052, ~y$w_buff1~0=~y$w_buff1~0_In1402893052, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out1402893052|, ~y~0=~y~0_In1402893052, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out1402893052|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1402893052} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 21:25:00,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In1292999659 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1292999659 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite11_Out1292999659|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1292999659 |P2Thread1of1ForFork1_#t~ite11_Out1292999659|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1292999659, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1292999659} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1292999659, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out1292999659|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1292999659} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 21:25:00,646 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L791-->L791-2: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In1171038757 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In1171038757 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In1171038757 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1171038757 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite12_Out1171038757|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1171038757 |P2Thread1of1ForFork1_#t~ite12_Out1171038757|) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1171038757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1171038757, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1171038757, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1171038757} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1171038757, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1171038757, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1171038757, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out1171038757|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1171038757} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 21:25:00,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L792-->L793: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1352598526 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1352598526 256)))) (or (and (= 0 ~y$r_buff0_thd3~0_Out1352598526) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd3~0_Out1352598526 ~y$r_buff0_thd3~0_In1352598526)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1352598526, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1352598526} OutVars{P2Thread1of1ForFork1_#t~ite13=|P2Thread1of1ForFork1_#t~ite13_Out1352598526|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1352598526, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1352598526} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite13, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 21:25:00,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L793-->L793-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-793723394 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-793723394 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-793723394 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In-793723394 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite14_Out-793723394| ~y$r_buff1_thd3~0_In-793723394) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork1_#t~ite14_Out-793723394| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-793723394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-793723394, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-793723394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-793723394} OutVars{P2Thread1of1ForFork1_#t~ite14=|P2Thread1of1ForFork1_#t~ite14_Out-793723394|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-793723394, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-793723394, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-793723394, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-793723394} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 21:25:00,647 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L793-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork1_#t~ite14_8|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|)) InVars {P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite14=|v_P2Thread1of1ForFork1_#t~ite14_7|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_15, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 21:25:00,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2033828177 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In2033828177 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2033828177 |P1Thread1of1ForFork0_#t~ite5_Out2033828177|)) (and (= 0 |P1Thread1of1ForFork0_#t~ite5_Out2033828177|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2033828177, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2033828177} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2033828177, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2033828177, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out2033828177|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 21:25:00,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L756-->L756-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-1882707881 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1882707881 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1882707881 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1882707881 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite6_Out-1882707881| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite6_Out-1882707881| ~y$w_buff1_used~0_In-1882707881)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1882707881, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1882707881, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1882707881, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1882707881} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1882707881, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1882707881, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1882707881, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-1882707881|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1882707881} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 21:25:00,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L757-->L757-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In107469922 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In107469922 256)))) (or (and (= 0 |P1Thread1of1ForFork0_#t~ite7_Out107469922|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In107469922 |P1Thread1of1ForFork0_#t~ite7_Out107469922|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In107469922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In107469922} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In107469922, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In107469922, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out107469922|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 21:25:00,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-747743493 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-747743493 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-747743493 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-747743493 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-747743493 |P1Thread1of1ForFork0_#t~ite8_Out-747743493|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork0_#t~ite8_Out-747743493| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-747743493, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-747743493, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-747743493, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-747743493} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-747743493, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-747743493, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-747743493, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-747743493|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-747743493} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 21:25:00,650 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L758-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd2~0_16) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_7|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 21:25:00,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [673] [673] L820-->L822-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_4 256) 0)) (or (= 0 (mod v_~y$w_buff0_used~0_89 256)) (= 0 (mod v_~y$r_buff0_thd0~0_67 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_89, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_67, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 21:25:00,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L822-2-->L822-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-455626114 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-455626114 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite19_Out-455626114| |ULTIMATE.start_main_#t~ite18_Out-455626114|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite18_Out-455626114| ~y~0_In-455626114)) (and (not .cse0) (= ~y$w_buff1~0_In-455626114 |ULTIMATE.start_main_#t~ite18_Out-455626114|) (not .cse1) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-455626114, ~y~0=~y~0_In-455626114, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-455626114, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455626114} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-455626114, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-455626114|, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-455626114|, ~y~0=~y~0_In-455626114, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-455626114, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-455626114} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-18 21:25:00,651 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [700] [700] L823-->L823-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-769064376 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In-769064376 256) 0))) (or (and (= ~y$w_buff0_used~0_In-769064376 |ULTIMATE.start_main_#t~ite20_Out-769064376|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite20_Out-769064376|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-769064376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-769064376} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-769064376, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-769064376, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-769064376|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-18 21:25:00,652 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L824-->L824-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In775807216 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In775807216 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In775807216 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In775807216 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In775807216 |ULTIMATE.start_main_#t~ite21_Out775807216|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite21_Out775807216|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In775807216, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In775807216, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In775807216, ~y$w_buff1_used~0=~y$w_buff1_used~0_In775807216} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In775807216, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In775807216, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out775807216|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In775807216, ~y$w_buff1_used~0=~y$w_buff1_used~0_In775807216} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-18 21:25:00,653 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L825-->L825-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In473279205 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In473279205 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out473279205| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite22_Out473279205| ~y$r_buff0_thd0~0_In473279205)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In473279205, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In473279205} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In473279205, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In473279205, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out473279205|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-18 21:25:00,654 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1566091169 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1566091169 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1566091169 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1566091169 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In1566091169 |ULTIMATE.start_main_#t~ite23_Out1566091169|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite23_Out1566091169|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1566091169, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1566091169, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1566091169, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1566091169} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1566091169, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1566091169, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1566091169, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1566091169|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1566091169} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-18 21:25:00,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L834-->L834-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2093573837 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite30_Out-2093573837| |ULTIMATE.start_main_#t~ite29_Out-2093573837|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-2093573837 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-2093573837 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-2093573837 256)) (and (= 0 (mod ~y$r_buff1_thd0~0_In-2093573837 256)) .cse0))) .cse1 (= ~y$w_buff0~0_In-2093573837 |ULTIMATE.start_main_#t~ite29_Out-2093573837|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite30_Out-2093573837| ~y$w_buff0~0_In-2093573837) (= |ULTIMATE.start_main_#t~ite29_In-2093573837| |ULTIMATE.start_main_#t~ite29_Out-2093573837|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2093573837, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In-2093573837|, ~y$w_buff0~0=~y$w_buff0~0_In-2093573837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2093573837, ~weak$$choice2~0=~weak$$choice2~0_In-2093573837, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2093573837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2093573837} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out-2093573837|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2093573837, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-2093573837|, ~y$w_buff0~0=~y$w_buff0~0_In-2093573837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2093573837, ~weak$$choice2~0=~weak$$choice2~0_In-2093573837, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2093573837, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2093573837} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 21:25:00,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L836-->L836-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-2014532891 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite35_In-2014532891| |ULTIMATE.start_main_#t~ite35_Out-2014532891|) (= ~y$w_buff0_used~0_In-2014532891 |ULTIMATE.start_main_#t~ite36_Out-2014532891|)) (and (= |ULTIMATE.start_main_#t~ite36_Out-2014532891| |ULTIMATE.start_main_#t~ite35_Out-2014532891|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2014532891 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-2014532891 256)) (and (= (mod ~y$r_buff1_thd0~0_In-2014532891 256) 0) .cse1) (and (= (mod ~y$w_buff1_used~0_In-2014532891 256) 0) .cse1))) .cse0 (= ~y$w_buff0_used~0_In-2014532891 |ULTIMATE.start_main_#t~ite35_Out-2014532891|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014532891, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2014532891, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_In-2014532891|, ~weak$$choice2~0=~weak$$choice2~0_In-2014532891, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2014532891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2014532891} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014532891, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2014532891, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out-2014532891|, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-2014532891|, ~weak$$choice2~0=~weak$$choice2~0_In-2014532891, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2014532891, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2014532891} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 21:25:00,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L837-->L837-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In201897660 256)))) (or (and (= ~y$w_buff1_used~0_In201897660 |ULTIMATE.start_main_#t~ite38_Out201897660|) (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In201897660 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In201897660 256)) (and (= (mod ~y$r_buff1_thd0~0_In201897660 256) 0) .cse0) (and .cse0 (= (mod ~y$w_buff1_used~0_In201897660 256) 0)))) .cse1 (= |ULTIMATE.start_main_#t~ite39_Out201897660| |ULTIMATE.start_main_#t~ite38_Out201897660|)) (and (= ~y$w_buff1_used~0_In201897660 |ULTIMATE.start_main_#t~ite39_Out201897660|) (not .cse1) (= |ULTIMATE.start_main_#t~ite38_In201897660| |ULTIMATE.start_main_#t~ite38_Out201897660|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In201897660, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In201897660, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_In201897660|, ~weak$$choice2~0=~weak$$choice2~0_In201897660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In201897660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In201897660} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In201897660, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out201897660|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In201897660, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out201897660|, ~weak$$choice2~0=~weak$$choice2~0_In201897660, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In201897660, ~y$w_buff1_used~0=~y$w_buff1_used~0_In201897660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 21:25:00,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [659] [659] L838-->L839: Formula: (and (= v_~y$r_buff0_thd0~0_61 v_~y$r_buff0_thd0~0_60) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_61, ~weak$$choice2~0=v_~weak$$choice2~0_20} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_60, ~weak$$choice2~0=v_~weak$$choice2~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:25:00,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L839-->L839-8: Formula: (let ((.cse5 (= |ULTIMATE.start_main_#t~ite45_Out2133642259| |ULTIMATE.start_main_#t~ite44_Out2133642259|)) (.cse2 (= (mod ~y$w_buff0_used~0_In2133642259 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2133642259 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In2133642259 256))) (.cse6 (= 0 (mod ~y$r_buff0_thd0~0_In2133642259 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In2133642259 256)))) (or (let ((.cse0 (not .cse6))) (and (= |ULTIMATE.start_main_#t~ite43_Out2133642259| |ULTIMATE.start_main_#t~ite44_Out2133642259|) (or .cse0 (not .cse1)) (not .cse2) (or (not .cse3) .cse0) .cse4 .cse5 (= 0 |ULTIMATE.start_main_#t~ite43_Out2133642259|))) (and (= |ULTIMATE.start_main_#t~ite43_In2133642259| |ULTIMATE.start_main_#t~ite43_Out2133642259|) (or (and (= ~y$r_buff1_thd0~0_In2133642259 |ULTIMATE.start_main_#t~ite44_Out2133642259|) .cse4 .cse5 (or .cse2 (and .cse3 .cse6) (and .cse1 .cse6))) (and (= |ULTIMATE.start_main_#t~ite45_Out2133642259| ~y$r_buff1_thd0~0_In2133642259) (not .cse4) (= |ULTIMATE.start_main_#t~ite44_In2133642259| |ULTIMATE.start_main_#t~ite44_Out2133642259|)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2133642259, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2133642259, ~weak$$choice2~0=~weak$$choice2~0_In2133642259, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_In2133642259|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2133642259, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133642259, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_In2133642259|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2133642259, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2133642259, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2133642259|, ~weak$$choice2~0=~weak$$choice2~0_In2133642259, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2133642259, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2133642259|, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out2133642259|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2133642259} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:25:00,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L841-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_7 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (not (= 0 (mod v_~y$flush_delayed~0_12 256))) (= 0 v_~y$flush_delayed~0_11) (= v_~y~0_22 v_~y$mem_tmp~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_12, ~y$flush_delayed~0=v_~y$flush_delayed~0_11, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_7, ~y~0=v_~y~0_22, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:25:00,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 21:25:00,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:25:00 BasicIcfg [2019-12-18 21:25:00,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:25:00,774 INFO L168 Benchmark]: Toolchain (without parser) took 31243.02 ms. Allocated memory was 146.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 103.2 MB in the beginning and 517.1 MB in the end (delta: -413.9 MB). Peak memory consumption was 867.5 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:00,775 INFO L168 Benchmark]: CDTParser took 1.43 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:25:00,777 INFO L168 Benchmark]: CACSL2BoogieTranslator took 796.95 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.8 MB in the beginning and 157.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:00,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.84 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 154.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:00,778 INFO L168 Benchmark]: Boogie Preprocessor took 40.08 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:00,779 INFO L168 Benchmark]: RCFGBuilder took 857.40 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 105.2 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:00,782 INFO L168 Benchmark]: TraceAbstraction took 29474.63 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 105.2 MB in the beginning and 517.1 MB in the end (delta: -411.9 MB). Peak memory consumption was 812.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:25:00,785 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.43 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 796.95 ms. Allocated memory was 146.8 MB in the beginning and 203.9 MB in the end (delta: 57.1 MB). Free memory was 102.8 MB in the beginning and 157.9 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.84 ms. Allocated memory is still 203.9 MB. Free memory was 157.9 MB in the beginning and 154.7 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.08 ms. Allocated memory is still 203.9 MB. Free memory was 154.7 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 857.40 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 105.2 MB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29474.63 ms. Allocated memory was 203.9 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 105.2 MB in the beginning and 517.1 MB in the end (delta: -411.9 MB). Peak memory consumption was 812.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 165 ProgramPointsBefore, 79 ProgramPointsAfterwards, 196 TransitionsBefore, 85 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 4245 VarBasedMoverChecksPositive, 151 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 50879 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L812] FCALL, FORK 0 pthread_create(&t1114, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1115, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1116, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L768] 3 y$w_buff1 = y$w_buff0 [L769] 3 y$w_buff0 = 2 [L770] 3 y$w_buff1_used = y$w_buff0_used [L771] 3 y$w_buff0_used = (_Bool)1 [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L748] 2 x = 1 [L751] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 156 locations, 2 error locations. Result: UNSAFE, OverallTime: 29.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2059 SDtfs, 2558 SDslu, 5598 SDs, 0 SdLazy, 3797 SolverSat, 232 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 25 SyntacticMatches, 12 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35296occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 48391 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 663 NumberOfCodeBlocks, 663 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 589 ConstructedInterpolants, 0 QuantifiedInterpolants, 115833 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...