/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:11:10,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:11:10,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:11:10,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:11:10,327 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:11:10,328 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:11:10,329 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:11:10,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:11:10,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:11:10,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:11:10,334 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:11:10,336 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:11:10,336 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:11:10,337 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:11:10,338 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:11:10,339 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:11:10,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:11:10,341 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:11:10,342 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:11:10,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:11:10,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:11:10,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:11:10,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:11:10,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:11:10,352 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:11:10,352 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:11:10,352 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:11:10,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:11:10,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:11:10,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:11:10,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:11:10,362 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:11:10,363 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:11:10,364 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:11:10,365 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:11:10,365 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:11:10,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:11:10,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:11:10,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:11:10,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:11:10,368 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:11:10,369 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:11:10,383 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:11:10,383 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:11:10,384 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:11:10,384 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:11:10,385 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:11:10,385 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:11:10,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:11:10,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:11:10,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:11:10,386 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:11:10,386 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:11:10,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:11:10,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:11:10,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:11:10,387 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:11:10,387 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:11:10,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:11:10,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:11:10,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:11:10,388 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:11:10,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:11:10,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:11:10,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:11:10,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:11:10,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:11:10,389 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:11:10,389 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:11:10,389 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:11:10,389 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:11:10,389 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:11:10,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:11:10,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:11:10,669 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:11:10,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:11:10,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:11:10,675 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:11:10,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2019-12-27 17:11:10,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2798f1cfa/ed2ccc6d466346e0a4aa75b2584aa954/FLAG14b79b260 [2019-12-27 17:11:11,251 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:11:11,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_rmo.opt.i [2019-12-27 17:11:11,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2798f1cfa/ed2ccc6d466346e0a4aa75b2584aa954/FLAG14b79b260 [2019-12-27 17:11:11,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2798f1cfa/ed2ccc6d466346e0a4aa75b2584aa954 [2019-12-27 17:11:11,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:11:11,564 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:11:11,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:11:11,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:11:11,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:11:11,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:11:11" (1/1) ... [2019-12-27 17:11:11,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:11, skipping insertion in model container [2019-12-27 17:11:11,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:11:11" (1/1) ... [2019-12-27 17:11:11,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:11:11,659 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:11:12,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:11:12,176 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:11:12,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:11:12,367 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:11:12,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12 WrapperNode [2019-12-27 17:11:12,367 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:11:12,368 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:11:12,368 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:11:12,368 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:11:12,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,396 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,433 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:11:12,434 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:11:12,434 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:11:12,434 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:11:12,444 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... [2019-12-27 17:11:12,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:11:12,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:11:12,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:11:12,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:11:12,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:11:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:11:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:11:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:11:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:11:12,544 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:11:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:11:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:11:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:11:12,545 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:11:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:11:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 17:11:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 17:11:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:11:12,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:11:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:11:12,548 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:11:13,301 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:11:13,301 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:11:13,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:11:13 BoogieIcfgContainer [2019-12-27 17:11:13,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:11:13,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:11:13,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:11:13,308 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:11:13,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:11:11" (1/3) ... [2019-12-27 17:11:13,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a11ebd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:11:13, skipping insertion in model container [2019-12-27 17:11:13,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:11:12" (2/3) ... [2019-12-27 17:11:13,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a11ebd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:11:13, skipping insertion in model container [2019-12-27 17:11:13,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:11:13" (3/3) ... [2019-12-27 17:11:13,311 INFO L109 eAbstractionObserver]: Analyzing ICFG mix046_rmo.opt.i [2019-12-27 17:11:13,321 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:11:13,322 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:11:13,330 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:11:13,331 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:11:13,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,374 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,375 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,376 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,376 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,377 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,378 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,378 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,386 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,387 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,387 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,387 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,387 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,388 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,388 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,388 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,389 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,390 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,406 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,407 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,408 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,409 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,410 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,414 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,415 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,417 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,417 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,418 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,418 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,420 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,421 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,421 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,422 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,424 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,424 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,425 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,426 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,426 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:11:13,441 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 17:11:13,461 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:11:13,461 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:11:13,461 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:11:13,462 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:11:13,462 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:11:13,462 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:11:13,462 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:11:13,462 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:11:13,479 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-27 17:11:13,481 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 17:11:13,588 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 17:11:13,588 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:11:13,603 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:11:13,623 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-27 17:11:13,671 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-27 17:11:13,671 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:11:13,677 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 263 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 17:11:13,692 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-27 17:11:13,693 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:11:19,113 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-27 17:11:19,253 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-27 17:11:19,276 INFO L206 etLargeBlockEncoding]: Checked pairs total: 52490 [2019-12-27 17:11:19,276 INFO L214 etLargeBlockEncoding]: Total number of compositions: 119 [2019-12-27 17:11:19,279 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-27 17:11:22,264 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 37086 states. [2019-12-27 17:11:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37086 states. [2019-12-27 17:11:22,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-27 17:11:22,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:22,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:22,273 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:22,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:22,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1862617909, now seen corresponding path program 1 times [2019-12-27 17:11:22,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:22,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113318981] [2019-12-27 17:11:22,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:22,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:22,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113318981] [2019-12-27 17:11:22,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:22,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:11:22,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [418361260] [2019-12-27 17:11:22,587 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:22,594 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:22,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 10 states and 9 transitions. [2019-12-27 17:11:22,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:22,617 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:11:22,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:11:22,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:22,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:11:22,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:22,634 INFO L87 Difference]: Start difference. First operand 37086 states. Second operand 3 states. [2019-12-27 17:11:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:23,360 INFO L93 Difference]: Finished difference Result 36830 states and 157144 transitions. [2019-12-27 17:11:23,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:11:23,361 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-27 17:11:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:23,947 INFO L225 Difference]: With dead ends: 36830 [2019-12-27 17:11:23,948 INFO L226 Difference]: Without dead ends: 36102 [2019-12-27 17:11:23,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:24,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36102 states. [2019-12-27 17:11:25,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36102 to 36102. [2019-12-27 17:11:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36102 states. [2019-12-27 17:11:25,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36102 states to 36102 states and 154176 transitions. [2019-12-27 17:11:25,834 INFO L78 Accepts]: Start accepts. Automaton has 36102 states and 154176 transitions. Word has length 9 [2019-12-27 17:11:25,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:25,835 INFO L462 AbstractCegarLoop]: Abstraction has 36102 states and 154176 transitions. [2019-12-27 17:11:25,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:11:25,836 INFO L276 IsEmpty]: Start isEmpty. Operand 36102 states and 154176 transitions. [2019-12-27 17:11:25,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:11:25,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:25,847 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:25,848 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:25,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:25,848 INFO L82 PathProgramCache]: Analyzing trace with hash 290643941, now seen corresponding path program 1 times [2019-12-27 17:11:25,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:25,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519373872] [2019-12-27 17:11:25,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:26,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519373872] [2019-12-27 17:11:26,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:26,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:11:26,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [910552675] [2019-12-27 17:11:26,004 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:26,006 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:26,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 39 transitions. [2019-12-27 17:11:26,018 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:26,065 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:11:26,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:11:26,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:26,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:11:26,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:11:26,068 INFO L87 Difference]: Start difference. First operand 36102 states and 154176 transitions. Second operand 5 states. [2019-12-27 17:11:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:28,454 INFO L93 Difference]: Finished difference Result 56134 states and 231868 transitions. [2019-12-27 17:11:28,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:11:28,455 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-12-27 17:11:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:28,733 INFO L225 Difference]: With dead ends: 56134 [2019-12-27 17:11:28,734 INFO L226 Difference]: Without dead ends: 56106 [2019-12-27 17:11:28,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:11:29,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56106 states. [2019-12-27 17:11:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56106 to 51222. [2019-12-27 17:11:30,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51222 states. [2019-12-27 17:11:31,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51222 states to 51222 states and 213628 transitions. [2019-12-27 17:11:31,064 INFO L78 Accepts]: Start accepts. Automaton has 51222 states and 213628 transitions. Word has length 15 [2019-12-27 17:11:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:31,064 INFO L462 AbstractCegarLoop]: Abstraction has 51222 states and 213628 transitions. [2019-12-27 17:11:31,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:11:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 51222 states and 213628 transitions. [2019-12-27 17:11:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 17:11:31,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:31,067 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:31,067 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:31,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash -497322091, now seen corresponding path program 1 times [2019-12-27 17:11:31,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:31,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903652456] [2019-12-27 17:11:31,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:31,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:31,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903652456] [2019-12-27 17:11:31,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:31,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:11:31,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1271804102] [2019-12-27 17:11:31,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:31,133 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:31,137 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 17:11:31,137 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:31,138 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:11:31,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:11:31,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:31,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:11:31,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:31,139 INFO L87 Difference]: Start difference. First operand 51222 states and 213628 transitions. Second operand 3 states. [2019-12-27 17:11:33,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:33,385 INFO L93 Difference]: Finished difference Result 40168 states and 154828 transitions. [2019-12-27 17:11:33,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:11:33,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 17:11:33,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:33,659 INFO L225 Difference]: With dead ends: 40168 [2019-12-27 17:11:33,659 INFO L226 Difference]: Without dead ends: 40168 [2019-12-27 17:11:33,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:33,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40168 states. [2019-12-27 17:11:34,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40168 to 40168. [2019-12-27 17:11:34,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40168 states. [2019-12-27 17:11:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40168 states to 40168 states and 154828 transitions. [2019-12-27 17:11:34,872 INFO L78 Accepts]: Start accepts. Automaton has 40168 states and 154828 transitions. Word has length 15 [2019-12-27 17:11:34,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:34,873 INFO L462 AbstractCegarLoop]: Abstraction has 40168 states and 154828 transitions. [2019-12-27 17:11:34,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:11:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 40168 states and 154828 transitions. [2019-12-27 17:11:34,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:11:34,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:34,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:34,876 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:34,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:34,876 INFO L82 PathProgramCache]: Analyzing trace with hash -13987850, now seen corresponding path program 1 times [2019-12-27 17:11:34,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:34,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659312058] [2019-12-27 17:11:34,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:34,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659312058] [2019-12-27 17:11:34,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:34,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:11:34,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [782001569] [2019-12-27 17:11:34,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:34,943 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:34,946 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 17:11:34,946 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:34,947 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:11:34,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:11:34,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:34,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:11:34,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:11:34,948 INFO L87 Difference]: Start difference. First operand 40168 states and 154828 transitions. Second operand 4 states. [2019-12-27 17:11:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:35,029 INFO L93 Difference]: Finished difference Result 16680 states and 53353 transitions. [2019-12-27 17:11:35,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:11:35,029 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:11:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:35,076 INFO L225 Difference]: With dead ends: 16680 [2019-12-27 17:11:35,077 INFO L226 Difference]: Without dead ends: 16680 [2019-12-27 17:11:35,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:11:35,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16680 states. [2019-12-27 17:11:35,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16680 to 16680. [2019-12-27 17:11:35,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16680 states. [2019-12-27 17:11:35,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16680 states to 16680 states and 53353 transitions. [2019-12-27 17:11:35,485 INFO L78 Accepts]: Start accepts. Automaton has 16680 states and 53353 transitions. Word has length 16 [2019-12-27 17:11:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:35,485 INFO L462 AbstractCegarLoop]: Abstraction has 16680 states and 53353 transitions. [2019-12-27 17:11:35,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:11:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 16680 states and 53353 transitions. [2019-12-27 17:11:35,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 17:11:35,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:35,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:35,492 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:35,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:35,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1397943155, now seen corresponding path program 1 times [2019-12-27 17:11:35,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:35,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411353061] [2019-12-27 17:11:35,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:35,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411353061] [2019-12-27 17:11:35,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:35,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:11:35,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [445083157] [2019-12-27 17:11:35,584 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:35,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:35,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 37 transitions. [2019-12-27 17:11:35,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:35,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:11:35,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:11:35,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:35,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:11:35,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:11:35,606 INFO L87 Difference]: Start difference. First operand 16680 states and 53353 transitions. Second operand 6 states. [2019-12-27 17:11:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:35,657 INFO L93 Difference]: Finished difference Result 2823 states and 7312 transitions. [2019-12-27 17:11:35,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:11:35,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-12-27 17:11:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:35,663 INFO L225 Difference]: With dead ends: 2823 [2019-12-27 17:11:35,664 INFO L226 Difference]: Without dead ends: 2823 [2019-12-27 17:11:35,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:11:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2823 states. [2019-12-27 17:11:35,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2823 to 2823. [2019-12-27 17:11:35,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2823 states. [2019-12-27 17:11:35,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2823 states to 2823 states and 7312 transitions. [2019-12-27 17:11:35,707 INFO L78 Accepts]: Start accepts. Automaton has 2823 states and 7312 transitions. Word has length 17 [2019-12-27 17:11:35,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:35,707 INFO L462 AbstractCegarLoop]: Abstraction has 2823 states and 7312 transitions. [2019-12-27 17:11:35,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:11:35,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2823 states and 7312 transitions. [2019-12-27 17:11:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 17:11:35,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:35,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:35,712 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash 34035109, now seen corresponding path program 1 times [2019-12-27 17:11:35,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:35,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489717958] [2019-12-27 17:11:35,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:35,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489717958] [2019-12-27 17:11:35,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:35,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:11:35,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [332069846] [2019-12-27 17:11:35,783 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:35,787 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:35,823 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 130 states and 273 transitions. [2019-12-27 17:11:35,823 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:35,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:11:35,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:11:35,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:35,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:11:35,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:11:35,869 INFO L87 Difference]: Start difference. First operand 2823 states and 7312 transitions. Second operand 8 states. [2019-12-27 17:11:36,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:36,025 INFO L93 Difference]: Finished difference Result 1357 states and 3889 transitions. [2019-12-27 17:11:36,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:11:36,032 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-27 17:11:36,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:36,035 INFO L225 Difference]: With dead ends: 1357 [2019-12-27 17:11:36,035 INFO L226 Difference]: Without dead ends: 1357 [2019-12-27 17:11:36,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:11:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2019-12-27 17:11:36,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1217. [2019-12-27 17:11:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-12-27 17:11:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 3489 transitions. [2019-12-27 17:11:36,058 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 3489 transitions. Word has length 29 [2019-12-27 17:11:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:36,058 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 3489 transitions. [2019-12-27 17:11:36,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:11:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 3489 transitions. [2019-12-27 17:11:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:11:36,062 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:36,062 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:36,062 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:36,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:36,063 INFO L82 PathProgramCache]: Analyzing trace with hash 2028178460, now seen corresponding path program 1 times [2019-12-27 17:11:36,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:36,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745842729] [2019-12-27 17:11:36,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:36,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745842729] [2019-12-27 17:11:36,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:36,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:11:36,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [450599857] [2019-12-27 17:11:36,157 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:36,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:36,289 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 17:11:36,289 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:36,290 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:11:36,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:11:36,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:36,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:11:36,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:36,291 INFO L87 Difference]: Start difference. First operand 1217 states and 3489 transitions. Second operand 3 states. [2019-12-27 17:11:36,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:36,348 INFO L93 Difference]: Finished difference Result 1228 states and 3505 transitions. [2019-12-27 17:11:36,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:11:36,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 17:11:36,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:36,351 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 17:11:36,351 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 17:11:36,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:36,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 17:11:36,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1222. [2019-12-27 17:11:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1222 states. [2019-12-27 17:11:36,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 3498 transitions. [2019-12-27 17:11:36,370 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 3498 transitions. Word has length 58 [2019-12-27 17:11:36,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:36,371 INFO L462 AbstractCegarLoop]: Abstraction has 1222 states and 3498 transitions. [2019-12-27 17:11:36,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:11:36,371 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 3498 transitions. [2019-12-27 17:11:36,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:11:36,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:36,375 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:36,375 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:36,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:36,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1114375606, now seen corresponding path program 1 times [2019-12-27 17:11:36,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:36,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562057540] [2019-12-27 17:11:36,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:36,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562057540] [2019-12-27 17:11:36,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:36,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:11:36,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1821302320] [2019-12-27 17:11:36,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:36,469 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:36,575 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 17:11:36,575 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:36,576 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:11:36,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:11:36,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:36,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:11:36,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:36,578 INFO L87 Difference]: Start difference. First operand 1222 states and 3498 transitions. Second operand 3 states. [2019-12-27 17:11:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:36,634 INFO L93 Difference]: Finished difference Result 1228 states and 3497 transitions. [2019-12-27 17:11:36,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:11:36,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 17:11:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:36,637 INFO L225 Difference]: With dead ends: 1228 [2019-12-27 17:11:36,637 INFO L226 Difference]: Without dead ends: 1228 [2019-12-27 17:11:36,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:36,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-12-27 17:11:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1223. [2019-12-27 17:11:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-12-27 17:11:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 3492 transitions. [2019-12-27 17:11:36,659 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 3492 transitions. Word has length 58 [2019-12-27 17:11:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:36,659 INFO L462 AbstractCegarLoop]: Abstraction has 1223 states and 3492 transitions. [2019-12-27 17:11:36,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:11:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 3492 transitions. [2019-12-27 17:11:36,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:11:36,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:36,663 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:36,663 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:36,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:36,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1114895507, now seen corresponding path program 1 times [2019-12-27 17:11:36,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:36,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389049373] [2019-12-27 17:11:36,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:36,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:36,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389049373] [2019-12-27 17:11:36,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:36,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:11:36,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774156416] [2019-12-27 17:11:36,781 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:36,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:36,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 142 states and 210 transitions. [2019-12-27 17:11:36,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:36,888 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:11:36,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:11:36,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:36,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:11:36,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:11:36,893 INFO L87 Difference]: Start difference. First operand 1223 states and 3492 transitions. Second operand 5 states. [2019-12-27 17:11:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:37,138 INFO L93 Difference]: Finished difference Result 1764 states and 5014 transitions. [2019-12-27 17:11:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 17:11:37,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-12-27 17:11:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:37,141 INFO L225 Difference]: With dead ends: 1764 [2019-12-27 17:11:37,141 INFO L226 Difference]: Without dead ends: 1764 [2019-12-27 17:11:37,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:11:37,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2019-12-27 17:11:37,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 1419. [2019-12-27 17:11:37,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1419 states. [2019-12-27 17:11:37,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 4068 transitions. [2019-12-27 17:11:37,166 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 4068 transitions. Word has length 58 [2019-12-27 17:11:37,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:37,166 INFO L462 AbstractCegarLoop]: Abstraction has 1419 states and 4068 transitions. [2019-12-27 17:11:37,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:11:37,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 4068 transitions. [2019-12-27 17:11:37,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:11:37,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:37,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:37,170 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:37,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:37,171 INFO L82 PathProgramCache]: Analyzing trace with hash -217131029, now seen corresponding path program 2 times [2019-12-27 17:11:37,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:37,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618978785] [2019-12-27 17:11:37,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:37,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:37,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618978785] [2019-12-27 17:11:37,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:37,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:11:37,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811192820] [2019-12-27 17:11:37,278 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:37,295 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:37,388 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 242 transitions. [2019-12-27 17:11:37,389 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:37,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:11:37,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:11:37,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:37,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:11:37,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:11:37,493 INFO L87 Difference]: Start difference. First operand 1419 states and 4068 transitions. Second operand 10 states. [2019-12-27 17:11:39,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:39,256 INFO L93 Difference]: Finished difference Result 3069 states and 8423 transitions. [2019-12-27 17:11:39,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 17:11:39,257 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-27 17:11:39,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:39,261 INFO L225 Difference]: With dead ends: 3069 [2019-12-27 17:11:39,261 INFO L226 Difference]: Without dead ends: 3069 [2019-12-27 17:11:39,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=356, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:11:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-12-27 17:11:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 1503. [2019-12-27 17:11:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-12-27 17:11:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 4316 transitions. [2019-12-27 17:11:39,289 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 4316 transitions. Word has length 58 [2019-12-27 17:11:39,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:39,289 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 4316 transitions. [2019-12-27 17:11:39,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:11:39,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 4316 transitions. [2019-12-27 17:11:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 17:11:39,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:39,293 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:39,294 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:39,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1417485459, now seen corresponding path program 3 times [2019-12-27 17:11:39,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:39,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266997306] [2019-12-27 17:11:39,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:39,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266997306] [2019-12-27 17:11:39,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:39,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:11:39,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [96822148] [2019-12-27 17:11:39,415 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:39,444 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:39,541 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 232 transitions. [2019-12-27 17:11:39,541 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:39,542 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:11:39,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:11:39,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:39,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:11:39,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:39,543 INFO L87 Difference]: Start difference. First operand 1503 states and 4316 transitions. Second operand 3 states. [2019-12-27 17:11:39,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:39,590 INFO L93 Difference]: Finished difference Result 1502 states and 4314 transitions. [2019-12-27 17:11:39,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:11:39,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-27 17:11:39,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:39,593 INFO L225 Difference]: With dead ends: 1502 [2019-12-27 17:11:39,593 INFO L226 Difference]: Without dead ends: 1502 [2019-12-27 17:11:39,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:11:39,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2019-12-27 17:11:39,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1081. [2019-12-27 17:11:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2019-12-27 17:11:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 3128 transitions. [2019-12-27 17:11:39,606 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 3128 transitions. Word has length 58 [2019-12-27 17:11:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:39,606 INFO L462 AbstractCegarLoop]: Abstraction has 1081 states and 3128 transitions. [2019-12-27 17:11:39,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:11:39,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 3128 transitions. [2019-12-27 17:11:39,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:11:39,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:39,608 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:39,608 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:39,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:39,609 INFO L82 PathProgramCache]: Analyzing trace with hash 368051854, now seen corresponding path program 1 times [2019-12-27 17:11:39,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:39,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149335915] [2019-12-27 17:11:39,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:39,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149335915] [2019-12-27 17:11:39,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:39,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:11:39,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1828725331] [2019-12-27 17:11:39,762 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:39,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:39,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 207 transitions. [2019-12-27 17:11:39,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:39,905 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:11:39,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:11:39,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:39,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:11:39,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:11:39,906 INFO L87 Difference]: Start difference. First operand 1081 states and 3128 transitions. Second operand 7 states. [2019-12-27 17:11:40,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:40,050 INFO L93 Difference]: Finished difference Result 2136 states and 5831 transitions. [2019-12-27 17:11:40,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:11:40,050 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 17:11:40,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:40,052 INFO L225 Difference]: With dead ends: 2136 [2019-12-27 17:11:40,053 INFO L226 Difference]: Without dead ends: 1497 [2019-12-27 17:11:40,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:11:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1497 states. [2019-12-27 17:11:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1497 to 951. [2019-12-27 17:11:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2019-12-27 17:11:40,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 2688 transitions. [2019-12-27 17:11:40,070 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 2688 transitions. Word has length 59 [2019-12-27 17:11:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:40,071 INFO L462 AbstractCegarLoop]: Abstraction has 951 states and 2688 transitions. [2019-12-27 17:11:40,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:11:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 2688 transitions. [2019-12-27 17:11:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:11:40,073 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:40,073 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:40,073 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:40,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1147587362, now seen corresponding path program 2 times [2019-12-27 17:11:40,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:40,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917260453] [2019-12-27 17:11:40,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:40,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:40,218 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917260453] [2019-12-27 17:11:40,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:40,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:11:40,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [179688813] [2019-12-27 17:11:40,220 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:40,257 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:40,391 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 248 transitions. [2019-12-27 17:11:40,391 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:40,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:11:40,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:11:40,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:40,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:11:40,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:11:40,418 INFO L87 Difference]: Start difference. First operand 951 states and 2688 transitions. Second operand 8 states. [2019-12-27 17:11:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:40,569 INFO L93 Difference]: Finished difference Result 1716 states and 4555 transitions. [2019-12-27 17:11:40,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:11:40,569 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-12-27 17:11:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:40,571 INFO L225 Difference]: With dead ends: 1716 [2019-12-27 17:11:40,571 INFO L226 Difference]: Without dead ends: 982 [2019-12-27 17:11:40,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-27 17:11:40,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2019-12-27 17:11:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 694. [2019-12-27 17:11:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-12-27 17:11:40,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 1729 transitions. [2019-12-27 17:11:40,586 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 1729 transitions. Word has length 59 [2019-12-27 17:11:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:40,587 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 1729 transitions. [2019-12-27 17:11:40,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:11:40,587 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 1729 transitions. [2019-12-27 17:11:40,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:11:40,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:40,588 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:40,589 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:40,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:40,589 INFO L82 PathProgramCache]: Analyzing trace with hash 83225480, now seen corresponding path program 3 times [2019-12-27 17:11:40,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:40,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060093019] [2019-12-27 17:11:40,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:40,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:40,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060093019] [2019-12-27 17:11:40,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:40,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:11:40,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1571810252] [2019-12-27 17:11:40,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:40,755 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:40,862 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 246 transitions. [2019-12-27 17:11:40,862 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:40,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:11:40,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:11:40,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:40,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:11:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:11:40,890 INFO L87 Difference]: Start difference. First operand 694 states and 1729 transitions. Second operand 7 states. [2019-12-27 17:11:41,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:41,190 INFO L93 Difference]: Finished difference Result 1375 states and 3364 transitions. [2019-12-27 17:11:41,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 17:11:41,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-27 17:11:41,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:41,191 INFO L225 Difference]: With dead ends: 1375 [2019-12-27 17:11:41,191 INFO L226 Difference]: Without dead ends: 429 [2019-12-27 17:11:41,192 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:11:41,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-27 17:11:41,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 290. [2019-12-27 17:11:41,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2019-12-27 17:11:41,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 531 transitions. [2019-12-27 17:11:41,197 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 531 transitions. Word has length 59 [2019-12-27 17:11:41,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:41,198 INFO L462 AbstractCegarLoop]: Abstraction has 290 states and 531 transitions. [2019-12-27 17:11:41,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:11:41,198 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 531 transitions. [2019-12-27 17:11:41,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 17:11:41,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:41,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:41,199 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:41,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:41,199 INFO L82 PathProgramCache]: Analyzing trace with hash 211375676, now seen corresponding path program 4 times [2019-12-27 17:11:41,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:41,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771441228] [2019-12-27 17:11:41,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:41,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:41,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771441228] [2019-12-27 17:11:41,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:41,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:11:41,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [202068446] [2019-12-27 17:11:41,258 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:41,278 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:41,412 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 222 transitions. [2019-12-27 17:11:41,412 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:41,425 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:11:41,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:11:41,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:41,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:11:41,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:11:41,426 INFO L87 Difference]: Start difference. First operand 290 states and 531 transitions. Second operand 4 states. [2019-12-27 17:11:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:41,520 INFO L93 Difference]: Finished difference Result 331 states and 580 transitions. [2019-12-27 17:11:41,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:11:41,520 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-27 17:11:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:41,521 INFO L225 Difference]: With dead ends: 331 [2019-12-27 17:11:41,521 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 17:11:41,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:11:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 17:11:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 237. [2019-12-27 17:11:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2019-12-27 17:11:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 414 transitions. [2019-12-27 17:11:41,528 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 414 transitions. Word has length 59 [2019-12-27 17:11:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:41,528 INFO L462 AbstractCegarLoop]: Abstraction has 237 states and 414 transitions. [2019-12-27 17:11:41,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:11:41,528 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 414 transitions. [2019-12-27 17:11:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:11:41,529 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:41,529 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:41,530 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:41,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:41,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1893006908, now seen corresponding path program 1 times [2019-12-27 17:11:41,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:41,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122803125] [2019-12-27 17:11:41,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:41,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:41,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122803125] [2019-12-27 17:11:41,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:41,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:11:41,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [548966888] [2019-12-27 17:11:41,913 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:41,930 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:42,058 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 181 states and 298 transitions. [2019-12-27 17:11:42,059 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:42,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:11:42,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:11:42,241 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 17:11:42,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 17:11:42,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:42,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 17:11:42,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-27 17:11:42,243 INFO L87 Difference]: Start difference. First operand 237 states and 414 transitions. Second operand 17 states. [2019-12-27 17:11:43,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:43,752 INFO L93 Difference]: Finished difference Result 517 states and 876 transitions. [2019-12-27 17:11:43,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 17:11:43,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 60 [2019-12-27 17:11:43,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:43,753 INFO L225 Difference]: With dead ends: 517 [2019-12-27 17:11:43,754 INFO L226 Difference]: Without dead ends: 485 [2019-12-27 17:11:43,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 6 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=1045, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 17:11:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-12-27 17:11:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 337. [2019-12-27 17:11:43,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2019-12-27 17:11:43,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 585 transitions. [2019-12-27 17:11:43,760 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 585 transitions. Word has length 60 [2019-12-27 17:11:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:43,760 INFO L462 AbstractCegarLoop]: Abstraction has 337 states and 585 transitions. [2019-12-27 17:11:43,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 17:11:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 585 transitions. [2019-12-27 17:11:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:11:43,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:43,761 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:43,761 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:43,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:43,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1191078724, now seen corresponding path program 2 times [2019-12-27 17:11:43,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:43,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563023680] [2019-12-27 17:11:43,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:11:44,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:11:44,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563023680] [2019-12-27 17:11:44,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:11:44,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 17:11:44,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361395599] [2019-12-27 17:11:44,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:11:44,268 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:11:44,410 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 149 states and 226 transitions. [2019-12-27 17:11:44,410 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:11:44,487 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 17:11:44,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 17:11:44,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:11:44,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 17:11:44,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 17:11:44,489 INFO L87 Difference]: Start difference. First operand 337 states and 585 transitions. Second operand 14 states. [2019-12-27 17:11:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:11:45,046 INFO L93 Difference]: Finished difference Result 439 states and 735 transitions. [2019-12-27 17:11:45,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 17:11:45,047 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 60 [2019-12-27 17:11:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:11:45,048 INFO L225 Difference]: With dead ends: 439 [2019-12-27 17:11:45,048 INFO L226 Difference]: Without dead ends: 407 [2019-12-27 17:11:45,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=119, Invalid=481, Unknown=0, NotChecked=0, Total=600 [2019-12-27 17:11:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2019-12-27 17:11:45,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 345. [2019-12-27 17:11:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-12-27 17:11:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 599 transitions. [2019-12-27 17:11:45,053 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 599 transitions. Word has length 60 [2019-12-27 17:11:45,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:11:45,053 INFO L462 AbstractCegarLoop]: Abstraction has 345 states and 599 transitions. [2019-12-27 17:11:45,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 17:11:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 599 transitions. [2019-12-27 17:11:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 17:11:45,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:11:45,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:11:45,055 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:11:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:11:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1108974140, now seen corresponding path program 3 times [2019-12-27 17:11:45,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:11:45,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600873306] [2019-12-27 17:11:45,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:11:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:11:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:11:45,168 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:11:45,168 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:11:45,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] ULTIMATE.startENTRY-->L833: Formula: (let ((.cse0 (store |v_#valid_72| 0 0))) (and (= 0 v_~__unbuffered_p0_EAX~0_33) (= v_~z$w_buff0_used~0_862 0) (= 0 v_~z$r_buff1_thd3~0_308) (= 0 v_~z$r_buff0_thd3~0_195) (= |v_ULTIMATE.start_main_~#t1237~0.offset_16| 0) (= |v_#valid_70| (store .cse0 |v_ULTIMATE.start_main_~#t1237~0.base_19| 1)) (= |v_#NULL.offset_7| 0) (= v_~x~0_30 0) (= v_~z$r_buff1_thd1~0_233 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd0~0_427 0) (= v_~b~0_102 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t1237~0.base_19| 4)) (= v_~__unbuffered_cnt~0_109 0) (= 0 v_~z$flush_delayed~0_82) (= 0 v_~weak$$choice0~0_17) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1237~0.base_19| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t1237~0.base_19|) |v_ULTIMATE.start_main_~#t1237~0.offset_16| 0)) |v_#memory_int_25|) (= v_~z$w_buff1~0_400 0) (= v_~z$r_buff0_thd2~0_88 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~__unbuffered_p3_EAX~0_243 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1237~0.base_19|)) (= v_~z$r_buff0_thd0~0_435 0) (= 0 v_~__unbuffered_p3_EBX~0_243) (= 0 v_~z$r_buff0_thd4~0_372) (= v_~y~0_50 0) (= v_~z$w_buff0~0_412 0) (= v_~weak$$choice2~0_150 0) (= 0 v_~z$r_buff1_thd4~0_281) (= v_~z~0_221 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff1_thd2~0_234 0) (= v_~z$read_delayed~0_7 0) (= 0 |v_#NULL.base_7|) (= v_~z$r_buff0_thd1~0_87 0) (= v_~z$w_buff1_used~0_620 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t1237~0.base_19|) (= v_~main$tmp_guard1~0_25 0) (= v_~a~0_234 0) (= v_~main$tmp_guard0~0_24 0) (= v_~z$mem_tmp~0_23 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_26|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_36|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_234, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_44|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_101|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_38|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_36|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_120|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_57|, ULTIMATE.start_main_~#t1240~0.offset=|v_ULTIMATE.start_main_~#t1240~0.offset_17|, ~a~0=v_~a~0_234, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_435, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_33, ULTIMATE.start_main_~#t1240~0.base=|v_ULTIMATE.start_main_~#t1240~0.base_22|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_372, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_243, #length=|v_#length_29|, ~z$mem_tmp~0=v_~z$mem_tmp~0_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_45|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_41|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_620, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_40|, ~z$flush_delayed~0=v_~z$flush_delayed~0_82, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_36|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_69|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_47|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_233, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_195, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~x~0=v_~x~0_30, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_281, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_43|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_40|, ~z$w_buff1~0=v_~z$w_buff1~0_400, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_34|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_36|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_51|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_55|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_427, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_28|, ~y~0=v_~y~0_50, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_88, ULTIMATE.start_main_~#t1239~0.base=|v_ULTIMATE.start_main_~#t1239~0.base_21|, ULTIMATE.start_main_~#t1237~0.offset=|v_ULTIMATE.start_main_~#t1237~0.offset_16|, ULTIMATE.start_main_~#t1238~0.base=|v_ULTIMATE.start_main_~#t1238~0.base_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_862, ~z$w_buff0~0=v_~z$w_buff0~0_412, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_40|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_28|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_308, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_53|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_46|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_243, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_61|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_64|, ULTIMATE.start_main_~#t1238~0.offset=|v_ULTIMATE.start_main_~#t1238~0.offset_17|, ULTIMATE.start_main_~#t1237~0.base=|v_ULTIMATE.start_main_~#t1237~0.base_19|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_36|, ~b~0=v_~b~0_102, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_14|, #valid=|v_#valid_70|, #memory_int=|v_#memory_int_25|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_22|, ~z~0=v_~z~0_221, ULTIMATE.start_main_~#t1239~0.offset=|v_ULTIMATE.start_main_~#t1239~0.offset_16|, ~weak$$choice2~0=v_~weak$$choice2~0_150, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_87} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1240~0.offset, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t1240~0.base, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1239~0.base, ULTIMATE.start_main_~#t1237~0.offset, ULTIMATE.start_main_~#t1238~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1238~0.offset, ULTIMATE.start_main_~#t1237~0.base, ULTIMATE.start_main_#t~ite41, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ULTIMATE.start_main_~#t1239~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:11:45,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L833-1-->L835: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1238~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1238~0.base_13|) |v_ULTIMATE.start_main_~#t1238~0.offset_11| 1)) |v_#memory_int_19|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t1238~0.base_13|)) (= (store |v_#valid_49| |v_ULTIMATE.start_main_~#t1238~0.base_13| 1) |v_#valid_48|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1238~0.base_13|) (= |v_ULTIMATE.start_main_~#t1238~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1238~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1238~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t1238~0.base=|v_ULTIMATE.start_main_~#t1238~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t1238~0.offset=|v_ULTIMATE.start_main_~#t1238~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1238~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1238~0.offset] because there is no mapped edge [2019-12-27 17:11:45,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L835-1-->L837: Formula: (and (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1239~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t1239~0.base_12|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1239~0.base_12|) 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1239~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1239~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1239~0.base_12|) |v_ULTIMATE.start_main_~#t1239~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1239~0.base_12|) (= |v_ULTIMATE.start_main_~#t1239~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1239~0.offset=|v_ULTIMATE.start_main_~#t1239~0.offset_10|, ULTIMATE.start_main_~#t1239~0.base=|v_ULTIMATE.start_main_~#t1239~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet16, #length, ULTIMATE.start_main_~#t1239~0.offset, ULTIMATE.start_main_~#t1239~0.base] because there is no mapped edge [2019-12-27 17:11:45,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1240~0.offset_10|) (= (select |v_#valid_40| |v_ULTIMATE.start_main_~#t1240~0.base_12|) 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1240~0.base_12| 4)) (not (= |v_ULTIMATE.start_main_~#t1240~0.base_12| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1240~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1240~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1240~0.base_12|) |v_ULTIMATE.start_main_~#t1240~0.offset_10| 3)) |v_#memory_int_13|) (= |v_#valid_39| (store |v_#valid_40| |v_ULTIMATE.start_main_~#t1240~0.base_12| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1240~0.base=|v_ULTIMATE.start_main_~#t1240~0.base_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ULTIMATE.start_main_~#t1240~0.offset=|v_ULTIMATE.start_main_~#t1240~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1240~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1240~0.offset] because there is no mapped edge [2019-12-27 17:11:45,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L4-->L810: Formula: (and (= v_~z$r_buff0_thd0~0_60 v_~z$r_buff1_thd0~0_36) (= v_~__unbuffered_p3_EBX~0_4 v_~b~0_4) (not (= 0 v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8)) (= v_~__unbuffered_p3_EAX~0_4 v_~a~0_3) (= v_~z$r_buff1_thd1~0_3 v_~z$r_buff0_thd1~0_3) (= v_~z$r_buff1_thd2~0_4 v_~z$r_buff0_thd2~0_4) (= v_~z$r_buff0_thd4~0_20 v_~z$r_buff1_thd4~0_14) (= 1 v_~a~0_3) (= v_~z$r_buff0_thd4~0_19 1) (= v_~z$r_buff0_thd3~0_17 v_~z$r_buff1_thd3~0_11)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_20, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_8, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_14, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_4, ~a~0=v_~a~0_3, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_60, ~b~0=v_~b~0_4, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_4, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_19, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_17, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_3, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_4} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-27 17:11:45,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_9|) (= v_~b~0_77 1) (= |v_P0Thread1of1ForFork0_#res.offset_9| 0) (= v_~x~0_21 v_~__unbuffered_p0_EAX~0_21) (= v_~__unbuffered_cnt~0_78 (+ v_~__unbuffered_cnt~0_79 1)) (= v_P0Thread1of1ForFork0_~arg.base_15 |v_P0Thread1of1ForFork0_#in~arg.base_15|) (= v_P0Thread1of1ForFork0_~arg.offset_15 |v_P0Thread1of1ForFork0_#in~arg.offset_15|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~x~0=v_~x~0_21} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_15|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_9|, ~b~0=v_~b~0_77, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_15|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_15, ~x~0=v_~x~0_21, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-27 17:11:45,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_12 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y~0_35 1) (= v_~x~0_26 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_12) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_12, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_12, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, ~y~0=v_~y~0_35, ~x~0=v_~x~0_26, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 17:11:45,179 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1474530262 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1474530262 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite11_Out1474530262|)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1474530262| ~z$w_buff0_used~0_In1474530262)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1474530262, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1474530262} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1474530262, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1474530262, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1474530262|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-27 17:11:45,180 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L774-2-->L774-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-320783233 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-320783233 256)))) (or (and (= ~z~0_In-320783233 |P2Thread1of1ForFork2_#t~ite3_Out-320783233|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite3_Out-320783233| ~z$w_buff1~0_In-320783233)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-320783233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-320783233, ~z$w_buff1~0=~z$w_buff1~0_In-320783233, ~z~0=~z~0_In-320783233} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-320783233|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-320783233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-320783233, ~z$w_buff1~0=~z$w_buff1~0_In-320783233, ~z~0=~z~0_In-320783233} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-27 17:11:45,181 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L812-->L812-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-912244423 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-912244423 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-912244423 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-912244423 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-912244423 |P3Thread1of1ForFork3_#t~ite12_Out-912244423|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite12_Out-912244423| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-912244423, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-912244423, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-912244423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-912244423} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-912244423, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-912244423, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-912244423, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-912244423, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out-912244423|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-27 17:11:45,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L813-->L814: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-852705482 256))) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-852705482 256) 0))) (or (and (= ~z$r_buff0_thd4~0_In-852705482 ~z$r_buff0_thd4~0_Out-852705482) (or .cse0 .cse1)) (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out-852705482) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-852705482, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-852705482} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-852705482, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-852705482, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out-852705482|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-27 17:11:45,182 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1912874991 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In1912874991 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In1912874991 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1912874991 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite14_Out1912874991| ~z$r_buff1_thd4~0_In1912874991) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P3Thread1of1ForFork3_#t~ite14_Out1912874991|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1912874991, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1912874991, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1912874991, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1912874991} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1912874991, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1912874991, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out1912874991|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1912874991, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1912874991} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-27 17:11:45,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [736] [736] L814-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_57 (+ v_~__unbuffered_cnt~0_58 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_32| v_~z$r_buff1_thd4~0_45) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_45, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_31|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 17:11:45,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L774-4-->L775: Formula: (= |v_P2Thread1of1ForFork2_#t~ite3_16| v_~z~0_56) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_16|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_11|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_15|, ~z~0=v_~z~0_56} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-27 17:11:45,183 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L775-->L775-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1471021188 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In1471021188 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out1471021188|)) (and (= ~z$w_buff0_used~0_In1471021188 |P2Thread1of1ForFork2_#t~ite5_Out1471021188|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1471021188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1471021188} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out1471021188|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1471021188, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1471021188} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-27 17:11:45,184 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-75100517 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-75100517 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-75100517 256))) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-75100517 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-75100517|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In-75100517 |P2Thread1of1ForFork2_#t~ite6_Out-75100517|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-75100517, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-75100517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-75100517, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-75100517} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-75100517|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-75100517, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-75100517, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-75100517, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-75100517} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-27 17:11:45,185 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L777-->L777-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-581990366 256))) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-581990366 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite7_Out-581990366| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-581990366| ~z$r_buff0_thd3~0_In-581990366)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-581990366, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-581990366} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-581990366, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-581990366, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-581990366|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-27 17:11:45,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L778-->L778-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In922850176 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In922850176 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In922850176 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In922850176 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In922850176 |P2Thread1of1ForFork2_#t~ite8_Out922850176|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite8_Out922850176|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In922850176, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In922850176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922850176, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In922850176} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In922850176, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In922850176, ~z$w_buff1_used~0=~z$w_buff1_used~0_In922850176, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In922850176, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out922850176|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:11:45,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L778-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_30| v_~z$r_buff1_thd3~0_74) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_30|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_74, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_29|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 17:11:45,186 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L839-1-->L845: Formula: (and (= 4 v_~__unbuffered_cnt~0_34) (= v_~main$tmp_guard0~0_13 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_13, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_12|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet18] because there is no mapped edge [2019-12-27 17:11:45,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L845-2-->L845-4: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2141367416 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-2141367416 256)))) (or (and (not .cse0) (= ~z$w_buff1~0_In-2141367416 |ULTIMATE.start_main_#t~ite19_Out-2141367416|) (not .cse1)) (and (or .cse0 .cse1) (= ~z~0_In-2141367416 |ULTIMATE.start_main_#t~ite19_Out-2141367416|)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2141367416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2141367416, ~z$w_buff1~0=~z$w_buff1~0_In-2141367416, ~z~0=~z~0_In-2141367416} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-2141367416|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2141367416, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2141367416, ~z$w_buff1~0=~z$w_buff1~0_In-2141367416, ~z~0=~z~0_In-2141367416} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 17:11:45,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L845-4-->L846: Formula: (= v_~z~0_30 |v_ULTIMATE.start_main_#t~ite19_9|) InVars {ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_9|} OutVars{ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_8|, ~z~0=v_~z~0_30, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ~z~0, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 17:11:45,187 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L846-->L846-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In366559927 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In366559927 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out366559927| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite21_Out366559927| ~z$w_buff0_used~0_In366559927)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In366559927, ~z$w_buff0_used~0=~z$w_buff0_used~0_In366559927} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In366559927, ~z$w_buff0_used~0=~z$w_buff0_used~0_In366559927, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out366559927|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 17:11:45,188 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L847-->L847-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In261756552 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In261756552 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In261756552 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In261756552 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out261756552| ~z$w_buff1_used~0_In261756552) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out261756552| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In261756552, ~z$w_buff0_used~0=~z$w_buff0_used~0_In261756552, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In261756552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In261756552} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In261756552, ~z$w_buff0_used~0=~z$w_buff0_used~0_In261756552, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In261756552, ~z$w_buff1_used~0=~z$w_buff1_used~0_In261756552, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out261756552|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 17:11:45,189 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In547100289 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In547100289 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite23_Out547100289| ~z$r_buff0_thd0~0_In547100289) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite23_Out547100289|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In547100289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In547100289} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In547100289, ~z$w_buff0_used~0=~z$w_buff0_used~0_In547100289, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out547100289|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-27 17:11:45,190 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-2144195329 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-2144195329 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-2144195329 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-2144195329 256)))) (or (and (= |ULTIMATE.start_main_#t~ite24_Out-2144195329| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite24_Out-2144195329| ~z$r_buff1_thd0~0_In-2144195329) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144195329, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144195329, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2144195329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144195329} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2144195329, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144195329, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2144195329, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-2144195329|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2144195329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-27 17:11:45,197 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L860-->L860-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In605901845 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite39_In605901845| |ULTIMATE.start_main_#t~ite39_Out605901845|) (= |ULTIMATE.start_main_#t~ite40_Out605901845| ~z$w_buff1_used~0_In605901845) (not .cse0)) (and (= ~z$w_buff1_used~0_In605901845 |ULTIMATE.start_main_#t~ite39_Out605901845|) (= |ULTIMATE.start_main_#t~ite40_Out605901845| |ULTIMATE.start_main_#t~ite39_Out605901845|) .cse0 (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In605901845 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In605901845 256))) (and (= 0 (mod ~z$r_buff1_thd0~0_In605901845 256)) .cse1) (= (mod ~z$w_buff0_used~0_In605901845 256) 0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In605901845, ~z$w_buff0_used~0=~z$w_buff0_used~0_In605901845, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In605901845|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In605901845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In605901845, ~weak$$choice2~0=~weak$$choice2~0_In605901845} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In605901845, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out605901845|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out605901845|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In605901845, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In605901845, ~z$w_buff1_used~0=~z$w_buff1_used~0_In605901845, ~weak$$choice2~0=~weak$$choice2~0_In605901845} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 17:11:45,198 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L861-->L862: Formula: (and (= v_~z$r_buff0_thd0~0_125 v_~z$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_28, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 17:11:45,199 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L862-->L862-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2125688080 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite45_In-2125688080| |ULTIMATE.start_main_#t~ite45_Out-2125688080|) (= |ULTIMATE.start_main_#t~ite46_Out-2125688080| ~z$r_buff1_thd0~0_In-2125688080)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-2125688080 256)))) (or (and (= (mod ~z$w_buff1_used~0_In-2125688080 256) 0) .cse1) (and (= (mod ~z$r_buff1_thd0~0_In-2125688080 256) 0) .cse1) (= 0 (mod ~z$w_buff0_used~0_In-2125688080 256)))) .cse0 (= |ULTIMATE.start_main_#t~ite46_Out-2125688080| |ULTIMATE.start_main_#t~ite45_Out-2125688080|) (= |ULTIMATE.start_main_#t~ite45_Out-2125688080| ~z$r_buff1_thd0~0_In-2125688080)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2125688080, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125688080, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2125688080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125688080, ~weak$$choice2~0=~weak$$choice2~0_In-2125688080, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_In-2125688080|} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2125688080, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2125688080, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2125688080, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2125688080, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2125688080|, ~weak$$choice2~0=~weak$$choice2~0_In-2125688080, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-2125688080|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 17:11:45,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L864-->L4: Formula: (and (= v_~z$mem_tmp~0_13 v_~z~0_110) (not (= 0 (mod v_~z$flush_delayed~0_38 256))) (= 0 v_~z$flush_delayed~0_37) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_13, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_38} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_13, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_37, ~z~0=v_~z~0_110, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:11:45,200 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_8 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_8, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 17:11:45,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:11:45 BasicIcfg [2019-12-27 17:11:45,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:11:45,311 INFO L168 Benchmark]: Toolchain (without parser) took 33747.82 ms. Allocated memory was 145.2 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 101.2 MB in the beginning and 964.7 MB in the end (delta: -863.5 MB). Peak memory consumption was 647.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:11:45,316 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:11:45,317 INFO L168 Benchmark]: CACSL2BoogieTranslator took 801.93 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 156.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:11:45,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.71 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 152.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-27 17:11:45,320 INFO L168 Benchmark]: Boogie Preprocessor took 40.96 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:11:45,323 INFO L168 Benchmark]: RCFGBuilder took 821.91 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 101.4 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-12-27 17:11:45,323 INFO L168 Benchmark]: TraceAbstraction took 32003.95 ms. Allocated memory was 202.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 100.7 MB in the beginning and 964.7 MB in the end (delta: -864.0 MB). Peak memory consumption was 588.8 MB. Max. memory is 7.1 GB. [2019-12-27 17:11:45,330 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 145.2 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 801.93 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.8 MB in the beginning and 156.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.71 ms. Allocated memory is still 202.9 MB. Free memory was 156.2 MB in the beginning and 152.9 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.96 ms. Allocated memory is still 202.9 MB. Free memory was 152.9 MB in the beginning and 150.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 821.91 ms. Allocated memory is still 202.9 MB. Free memory was 150.3 MB in the beginning and 101.4 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32003.95 ms. Allocated memory was 202.9 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 100.7 MB in the beginning and 964.7 MB in the end (delta: -864.0 MB). Peak memory consumption was 588.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 181 ProgramPointsBefore, 92 ProgramPointsAfterwards, 209 TransitionsBefore, 100 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 25 ChoiceCompositions, 4988 VarBasedMoverChecksPositive, 283 VarBasedMoverChecksNegative, 145 SemBasedMoverChecksPositive, 210 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 52490 CheckedPairsTotal, 119 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L833] FCALL, FORK 0 pthread_create(&t1237, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1238, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1239, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1240, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 4 z$w_buff1 = z$w_buff0 [L789] 4 z$w_buff0 = 2 [L790] 4 z$w_buff1_used = z$w_buff0_used [L791] 4 z$w_buff0_used = (_Bool)1 [L810] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L774] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L812] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L775] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L776] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L777] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L845] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L847] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L848] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L849] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 z$flush_delayed = weak$$choice2 [L855] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L857] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L858] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L859] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L860] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L862] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 31.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1988 SDtfs, 2803 SDslu, 5357 SDs, 0 SdLazy, 3091 SolverSat, 261 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 60 SyntacticMatches, 23 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51222occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 8644 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 807 NumberOfCodeBlocks, 807 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 730 ConstructedInterpolants, 0 QuantifiedInterpolants, 207055 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...