/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 02:56:46,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 02:56:46,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 02:56:46,346 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 02:56:46,347 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 02:56:46,349 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 02:56:46,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 02:56:46,361 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 02:56:46,365 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 02:56:46,368 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 02:56:46,370 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 02:56:46,371 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 02:56:46,372 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 02:56:46,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 02:56:46,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 02:56:46,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 02:56:46,379 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 02:56:46,380 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 02:56:46,381 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 02:56:46,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 02:56:46,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 02:56:46,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 02:56:46,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 02:56:46,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 02:56:46,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 02:56:46,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 02:56:46,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 02:56:46,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 02:56:46,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 02:56:46,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 02:56:46,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 02:56:46,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 02:56:46,406 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 02:56:46,407 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 02:56:46,408 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 02:56:46,409 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 02:56:46,409 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 02:56:46,410 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 02:56:46,410 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 02:56:46,411 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 02:56:46,412 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 02:56:46,413 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-27 02:56:46,438 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 02:56:46,438 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 02:56:46,439 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 02:56:46,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 02:56:46,440 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 02:56:46,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 02:56:46,440 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 02:56:46,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 02:56:46,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 02:56:46,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 02:56:46,441 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 02:56:46,441 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 02:56:46,442 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 02:56:46,442 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 02:56:46,442 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 02:56:46,442 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 02:56:46,442 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 02:56:46,442 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 02:56:46,443 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 02:56:46,443 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 02:56:46,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 02:56:46,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:56:46,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 02:56:46,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 02:56:46,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 02:56:46,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 02:56:46,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 02:56:46,444 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 02:56:46,445 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 02:56:46,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 02:56:46,764 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 02:56:46,767 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 02:56:46,769 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 02:56:46,769 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 02:56:46,770 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-27 02:56:46,850 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dcdd5fde/72839b27a1554dc99ac977842fcb099b/FLAG67e76aada [2019-12-27 02:56:47,405 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 02:56:47,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt.i [2019-12-27 02:56:47,426 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dcdd5fde/72839b27a1554dc99ac977842fcb099b/FLAG67e76aada [2019-12-27 02:56:47,688 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dcdd5fde/72839b27a1554dc99ac977842fcb099b [2019-12-27 02:56:47,697 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 02:56:47,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 02:56:47,699 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 02:56:47,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 02:56:47,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 02:56:47,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:56:47" (1/1) ... [2019-12-27 02:56:47,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39dfbf39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:47, skipping insertion in model container [2019-12-27 02:56:47,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 02:56:47" (1/1) ... [2019-12-27 02:56:47,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 02:56:47,770 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 02:56:48,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:56:48,337 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 02:56:48,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 02:56:48,498 INFO L208 MainTranslator]: Completed translation [2019-12-27 02:56:48,498 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48 WrapperNode [2019-12-27 02:56:48,498 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 02:56:48,499 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 02:56:48,499 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 02:56:48,500 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 02:56:48,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 02:56:48,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 02:56:48,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 02:56:48,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 02:56:48,583 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,598 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,602 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... [2019-12-27 02:56:48,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 02:56:48,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 02:56:48,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 02:56:48,612 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 02:56:48,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 02:56:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 02:56:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 02:56:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 02:56:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 02:56:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 02:56:48,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 02:56:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 02:56:48,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 02:56:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 02:56:48,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 02:56:48,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 02:56:48,691 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 02:56:49,381 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 02:56:49,381 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 02:56:49,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:56:49 BoogieIcfgContainer [2019-12-27 02:56:49,383 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 02:56:49,384 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 02:56:49,384 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 02:56:49,388 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 02:56:49,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 02:56:47" (1/3) ... [2019-12-27 02:56:49,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182ca0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:56:49, skipping insertion in model container [2019-12-27 02:56:49,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 02:56:48" (2/3) ... [2019-12-27 02:56:49,390 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@182ca0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 02:56:49, skipping insertion in model container [2019-12-27 02:56:49,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 02:56:49" (3/3) ... [2019-12-27 02:56:49,392 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt.i [2019-12-27 02:56:49,403 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 02:56:49,404 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 02:56:49,412 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 02:56:49,413 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 02:56:49,451 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,452 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,452 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,452 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,453 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,454 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,455 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,456 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,457 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,458 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,459 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,461 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,461 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,462 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,463 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,481 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,482 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,483 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,483 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,484 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,488 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,488 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,489 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 02:56:49,507 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 02:56:49,529 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 02:56:49,530 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 02:56:49,530 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 02:56:49,530 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 02:56:49,530 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 02:56:49,531 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 02:56:49,531 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 02:56:49,531 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 02:56:49,556 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 180 transitions [2019-12-27 02:56:49,558 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 02:56:49,699 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 02:56:49,700 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:56:49,712 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:56:49,729 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 146 places, 180 transitions [2019-12-27 02:56:49,777 INFO L132 PetriNetUnfolder]: 41/178 cut-off events. [2019-12-27 02:56:49,777 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 02:56:49,786 INFO L76 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 178 events. 41/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 266 event pairs. 0/135 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 02:56:49,801 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10378 [2019-12-27 02:56:49,805 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 02:56:54,086 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-27 02:56:54,193 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-27 02:56:54,228 INFO L206 etLargeBlockEncoding]: Checked pairs total: 46078 [2019-12-27 02:56:54,228 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-27 02:56:54,232 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 78 places, 90 transitions [2019-12-27 02:56:54,691 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8413 states. [2019-12-27 02:56:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 8413 states. [2019-12-27 02:56:54,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 02:56:54,699 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:54,700 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 02:56:54,700 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:54,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:54,707 INFO L82 PathProgramCache]: Analyzing trace with hash 693777882, now seen corresponding path program 1 times [2019-12-27 02:56:54,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:54,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351605359] [2019-12-27 02:56:54,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:54,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:54,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351605359] [2019-12-27 02:56:54,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:54,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 02:56:54,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876154233] [2019-12-27 02:56:54,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:54,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:54,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:54,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:54,965 INFO L87 Difference]: Start difference. First operand 8413 states. Second operand 3 states. [2019-12-27 02:56:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:55,276 INFO L93 Difference]: Finished difference Result 8377 states and 27415 transitions. [2019-12-27 02:56:55,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:55,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 02:56:55,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:55,374 INFO L225 Difference]: With dead ends: 8377 [2019-12-27 02:56:55,374 INFO L226 Difference]: Without dead ends: 8208 [2019-12-27 02:56:55,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8208 states. [2019-12-27 02:56:55,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8208 to 8208. [2019-12-27 02:56:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8208 states. [2019-12-27 02:56:55,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8208 states to 8208 states and 26895 transitions. [2019-12-27 02:56:55,880 INFO L78 Accepts]: Start accepts. Automaton has 8208 states and 26895 transitions. Word has length 5 [2019-12-27 02:56:55,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:55,880 INFO L462 AbstractCegarLoop]: Abstraction has 8208 states and 26895 transitions. [2019-12-27 02:56:55,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:55,881 INFO L276 IsEmpty]: Start isEmpty. Operand 8208 states and 26895 transitions. [2019-12-27 02:56:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:56:55,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:55,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:55,883 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:55,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash 2143808117, now seen corresponding path program 1 times [2019-12-27 02:56:55,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:55,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182933495] [2019-12-27 02:56:55,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:55,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:55,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182933495] [2019-12-27 02:56:55,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:55,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:56:55,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313668574] [2019-12-27 02:56:55,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:55,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:55,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:55,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:55,950 INFO L87 Difference]: Start difference. First operand 8208 states and 26895 transitions. Second operand 3 states. [2019-12-27 02:56:55,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:55,980 INFO L93 Difference]: Finished difference Result 1326 states and 3037 transitions. [2019-12-27 02:56:55,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:55,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 02:56:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:55,988 INFO L225 Difference]: With dead ends: 1326 [2019-12-27 02:56:55,988 INFO L226 Difference]: Without dead ends: 1326 [2019-12-27 02:56:55,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:55,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2019-12-27 02:56:56,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 1326. [2019-12-27 02:56:56,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-12-27 02:56:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 3037 transitions. [2019-12-27 02:56:56,020 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 3037 transitions. Word has length 11 [2019-12-27 02:56:56,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:56,020 INFO L462 AbstractCegarLoop]: Abstraction has 1326 states and 3037 transitions. [2019-12-27 02:56:56,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:56,021 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 3037 transitions. [2019-12-27 02:56:56,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 02:56:56,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:56,022 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:56,022 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:56,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:56,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1923085964, now seen corresponding path program 1 times [2019-12-27 02:56:56,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:56,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852849839] [2019-12-27 02:56:56,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:56,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:56,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852849839] [2019-12-27 02:56:56,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:56,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:56:56,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430367964] [2019-12-27 02:56:56,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:56:56,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:56,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:56:56,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:56:56,121 INFO L87 Difference]: Start difference. First operand 1326 states and 3037 transitions. Second operand 4 states. [2019-12-27 02:56:56,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:56,450 INFO L93 Difference]: Finished difference Result 1806 states and 4001 transitions. [2019-12-27 02:56:56,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 02:56:56,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 02:56:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:56,464 INFO L225 Difference]: With dead ends: 1806 [2019-12-27 02:56:56,465 INFO L226 Difference]: Without dead ends: 1806 [2019-12-27 02:56:56,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:56:56,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2019-12-27 02:56:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1654. [2019-12-27 02:56:56,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1654 states. [2019-12-27 02:56:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1654 states to 1654 states and 3712 transitions. [2019-12-27 02:56:56,543 INFO L78 Accepts]: Start accepts. Automaton has 1654 states and 3712 transitions. Word has length 11 [2019-12-27 02:56:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:56,544 INFO L462 AbstractCegarLoop]: Abstraction has 1654 states and 3712 transitions. [2019-12-27 02:56:56,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:56:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1654 states and 3712 transitions. [2019-12-27 02:56:56,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 02:56:56,554 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:56,554 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] [2019-12-27 02:56:56,555 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:56,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:56,555 INFO L82 PathProgramCache]: Analyzing trace with hash 909891733, now seen corresponding path program 1 times [2019-12-27 02:56:56,556 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:56,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018709312] [2019-12-27 02:56:56,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:56,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:56,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:56,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018709312] [2019-12-27 02:56:56,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:56,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:56:56,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464437808] [2019-12-27 02:56:56,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 02:56:56,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 02:56:56,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:56:56,698 INFO L87 Difference]: Start difference. First operand 1654 states and 3712 transitions. Second operand 4 states. [2019-12-27 02:56:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:56,716 INFO L93 Difference]: Finished difference Result 356 states and 659 transitions. [2019-12-27 02:56:56,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 02:56:56,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-27 02:56:56,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:56,719 INFO L225 Difference]: With dead ends: 356 [2019-12-27 02:56:56,720 INFO L226 Difference]: Without dead ends: 356 [2019-12-27 02:56:56,720 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 02:56:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-27 02:56:56,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 321. [2019-12-27 02:56:56,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-12-27 02:56:56,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 594 transitions. [2019-12-27 02:56:56,728 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 594 transitions. Word has length 23 [2019-12-27 02:56:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:56,729 INFO L462 AbstractCegarLoop]: Abstraction has 321 states and 594 transitions. [2019-12-27 02:56:56,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 02:56:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 594 transitions. [2019-12-27 02:56:56,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:56:56,731 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:56,731 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] [2019-12-27 02:56:56,731 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:56,732 INFO L82 PathProgramCache]: Analyzing trace with hash 763517816, now seen corresponding path program 1 times [2019-12-27 02:56:56,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:56,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282288974] [2019-12-27 02:56:56,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:56,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 02:56:56,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282288974] [2019-12-27 02:56:56,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:56,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 02:56:56,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316427913] [2019-12-27 02:56:56,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:56,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:56,912 INFO L87 Difference]: Start difference. First operand 321 states and 594 transitions. Second operand 3 states. [2019-12-27 02:56:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:56,970 INFO L93 Difference]: Finished difference Result 331 states and 608 transitions. [2019-12-27 02:56:56,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:56,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 02:56:56,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:56,973 INFO L225 Difference]: With dead ends: 331 [2019-12-27 02:56:56,973 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 02:56:56,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:56,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 02:56:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 327. [2019-12-27 02:56:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-27 02:56:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 604 transitions. [2019-12-27 02:56:56,982 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 604 transitions. Word has length 52 [2019-12-27 02:56:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:56,986 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 604 transitions. [2019-12-27 02:56:56,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 604 transitions. [2019-12-27 02:56:56,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:56:56,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:56,990 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] [2019-12-27 02:56:56,991 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:56,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:56,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1269350019, now seen corresponding path program 1 times [2019-12-27 02:56:56,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:56,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914647023] [2019-12-27 02:56:56,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:57,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914647023] [2019-12-27 02:56:57,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:57,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 02:56:57,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446680274] [2019-12-27 02:56:57,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 02:56:57,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:57,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 02:56:57,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 02:56:57,138 INFO L87 Difference]: Start difference. First operand 327 states and 604 transitions. Second operand 5 states. [2019-12-27 02:56:57,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:57,350 INFO L93 Difference]: Finished difference Result 458 states and 840 transitions. [2019-12-27 02:56:57,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 02:56:57,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-12-27 02:56:57,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:57,354 INFO L225 Difference]: With dead ends: 458 [2019-12-27 02:56:57,354 INFO L226 Difference]: Without dead ends: 458 [2019-12-27 02:56:57,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:56:57,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2019-12-27 02:56:57,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 374. [2019-12-27 02:56:57,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2019-12-27 02:56:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 695 transitions. [2019-12-27 02:56:57,364 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 695 transitions. Word has length 52 [2019-12-27 02:56:57,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:57,365 INFO L462 AbstractCegarLoop]: Abstraction has 374 states and 695 transitions. [2019-12-27 02:56:57,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 02:56:57,365 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 695 transitions. [2019-12-27 02:56:57,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:56:57,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:57,367 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] [2019-12-27 02:56:57,367 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:57,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:57,367 INFO L82 PathProgramCache]: Analyzing trace with hash 544633013, now seen corresponding path program 2 times [2019-12-27 02:56:57,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:57,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692955890] [2019-12-27 02:56:57,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:57,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:57,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692955890] [2019-12-27 02:56:57,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:57,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:56:57,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106546879] [2019-12-27 02:56:57,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:56:57,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:57,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:56:57,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:56:57,589 INFO L87 Difference]: Start difference. First operand 374 states and 695 transitions. Second operand 6 states. [2019-12-27 02:56:57,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:57,917 INFO L93 Difference]: Finished difference Result 513 states and 942 transitions. [2019-12-27 02:56:57,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 02:56:57,917 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 02:56:57,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:57,920 INFO L225 Difference]: With dead ends: 513 [2019-12-27 02:56:57,920 INFO L226 Difference]: Without dead ends: 513 [2019-12-27 02:56:57,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:56:57,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2019-12-27 02:56:57,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 406. [2019-12-27 02:56:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 02:56:57,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 754 transitions. [2019-12-27 02:56:57,931 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 754 transitions. Word has length 52 [2019-12-27 02:56:57,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:57,932 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 754 transitions. [2019-12-27 02:56:57,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:56:57,932 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 754 transitions. [2019-12-27 02:56:57,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:56:57,933 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:57,934 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] [2019-12-27 02:56:57,934 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:57,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:57,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1227473235, now seen corresponding path program 3 times [2019-12-27 02:56:57,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:57,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301327518] [2019-12-27 02:56:57,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:58,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301327518] [2019-12-27 02:56:58,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:58,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:56:58,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804272551] [2019-12-27 02:56:58,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 02:56:58,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:58,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 02:56:58,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 02:56:58,048 INFO L87 Difference]: Start difference. First operand 406 states and 754 transitions. Second operand 6 states. [2019-12-27 02:56:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:58,364 INFO L93 Difference]: Finished difference Result 694 states and 1274 transitions. [2019-12-27 02:56:58,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 02:56:58,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 02:56:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:58,369 INFO L225 Difference]: With dead ends: 694 [2019-12-27 02:56:58,369 INFO L226 Difference]: Without dead ends: 694 [2019-12-27 02:56:58,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 02:56:58,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-12-27 02:56:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 445. [2019-12-27 02:56:58,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-12-27 02:56:58,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 833 transitions. [2019-12-27 02:56:58,383 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 833 transitions. Word has length 52 [2019-12-27 02:56:58,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:58,383 INFO L462 AbstractCegarLoop]: Abstraction has 445 states and 833 transitions. [2019-12-27 02:56:58,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 02:56:58,384 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 833 transitions. [2019-12-27 02:56:58,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 02:56:58,385 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:58,385 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:56:58,386 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:58,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:58,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1833025349, now seen corresponding path program 4 times [2019-12-27 02:56:58,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:58,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139478534] [2019-12-27 02:56:58,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:58,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:58,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139478534] [2019-12-27 02:56:58,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:58,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:56:58,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613319754] [2019-12-27 02:56:58,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:56:58,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:58,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:56:58,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:58,482 INFO L87 Difference]: Start difference. First operand 445 states and 833 transitions. Second operand 3 states. [2019-12-27 02:56:58,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:58,494 INFO L93 Difference]: Finished difference Result 406 states and 739 transitions. [2019-12-27 02:56:58,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:56:58,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 02:56:58,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:58,496 INFO L225 Difference]: With dead ends: 406 [2019-12-27 02:56:58,496 INFO L226 Difference]: Without dead ends: 406 [2019-12-27 02:56:58,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:56:58,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-12-27 02:56:58,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2019-12-27 02:56:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-12-27 02:56:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 739 transitions. [2019-12-27 02:56:58,505 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 739 transitions. Word has length 52 [2019-12-27 02:56:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:58,505 INFO L462 AbstractCegarLoop]: Abstraction has 406 states and 739 transitions. [2019-12-27 02:56:58,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:56:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 739 transitions. [2019-12-27 02:56:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:56:58,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:58,507 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] [2019-12-27 02:56:58,507 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:58,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:58,508 INFO L82 PathProgramCache]: Analyzing trace with hash 513839464, now seen corresponding path program 1 times [2019-12-27 02:56:58,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:58,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798402649] [2019-12-27 02:56:58,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:58,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798402649] [2019-12-27 02:56:58,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:58,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 02:56:58,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292512186] [2019-12-27 02:56:58,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 02:56:58,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:58,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 02:56:58,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 02:56:58,718 INFO L87 Difference]: Start difference. First operand 406 states and 739 transitions. Second operand 8 states. [2019-12-27 02:56:59,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:56:59,266 INFO L93 Difference]: Finished difference Result 677 states and 1203 transitions. [2019-12-27 02:56:59,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 02:56:59,267 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2019-12-27 02:56:59,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:56:59,272 INFO L225 Difference]: With dead ends: 677 [2019-12-27 02:56:59,272 INFO L226 Difference]: Without dead ends: 677 [2019-12-27 02:56:59,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2019-12-27 02:56:59,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2019-12-27 02:56:59,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 362. [2019-12-27 02:56:59,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2019-12-27 02:56:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 654 transitions. [2019-12-27 02:56:59,283 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 654 transitions. Word has length 53 [2019-12-27 02:56:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:56:59,283 INFO L462 AbstractCegarLoop]: Abstraction has 362 states and 654 transitions. [2019-12-27 02:56:59,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 02:56:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 654 transitions. [2019-12-27 02:56:59,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:56:59,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:56:59,285 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] [2019-12-27 02:56:59,285 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:56:59,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:56:59,286 INFO L82 PathProgramCache]: Analyzing trace with hash -162355984, now seen corresponding path program 2 times [2019-12-27 02:56:59,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:56:59,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427956523] [2019-12-27 02:56:59,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:56:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:56:59,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:56:59,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427956523] [2019-12-27 02:56:59,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:56:59,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:56:59,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195845755] [2019-12-27 02:56:59,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:56:59,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:56:59,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:56:59,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:56:59,569 INFO L87 Difference]: Start difference. First operand 362 states and 654 transitions. Second operand 13 states. [2019-12-27 02:57:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:00,123 INFO L93 Difference]: Finished difference Result 795 states and 1439 transitions. [2019-12-27 02:57:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 02:57:00,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-12-27 02:57:00,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:00,128 INFO L225 Difference]: With dead ends: 795 [2019-12-27 02:57:00,128 INFO L226 Difference]: Without dead ends: 363 [2019-12-27 02:57:00,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:57:00,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2019-12-27 02:57:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 330. [2019-12-27 02:57:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-12-27 02:57:00,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 568 transitions. [2019-12-27 02:57:00,136 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 568 transitions. Word has length 53 [2019-12-27 02:57:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:00,136 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 568 transitions. [2019-12-27 02:57:00,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:57:00,137 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 568 transitions. [2019-12-27 02:57:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 02:57:00,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:00,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:00,138 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:00,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:00,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1236840700, now seen corresponding path program 3 times [2019-12-27 02:57:00,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:00,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625355351] [2019-12-27 02:57:00,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:00,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:00,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625355351] [2019-12-27 02:57:00,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:00,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 02:57:00,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860265733] [2019-12-27 02:57:00,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 02:57:00,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:00,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 02:57:00,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:00,207 INFO L87 Difference]: Start difference. First operand 330 states and 568 transitions. Second operand 3 states. [2019-12-27 02:57:00,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:00,243 INFO L93 Difference]: Finished difference Result 330 states and 567 transitions. [2019-12-27 02:57:00,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 02:57:00,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-12-27 02:57:00,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:00,245 INFO L225 Difference]: With dead ends: 330 [2019-12-27 02:57:00,245 INFO L226 Difference]: Without dead ends: 330 [2019-12-27 02:57:00,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 02:57:00,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2019-12-27 02:57:00,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 266. [2019-12-27 02:57:00,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-12-27 02:57:00,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 455 transitions. [2019-12-27 02:57:00,252 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 455 transitions. Word has length 53 [2019-12-27 02:57:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:00,252 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 455 transitions. [2019-12-27 02:57:00,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 02:57:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 455 transitions. [2019-12-27 02:57:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 02:57:00,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:00,253 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] [2019-12-27 02:57:00,253 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:00,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:00,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1221221950, now seen corresponding path program 1 times [2019-12-27 02:57:00,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:00,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267618019] [2019-12-27 02:57:00,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:00,368 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267618019] [2019-12-27 02:57:00,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:00,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 02:57:00,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030253363] [2019-12-27 02:57:00,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 02:57:00,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:00,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 02:57:00,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 02:57:00,369 INFO L87 Difference]: Start difference. First operand 266 states and 455 transitions. Second operand 7 states. [2019-12-27 02:57:00,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:00,470 INFO L93 Difference]: Finished difference Result 372 states and 622 transitions. [2019-12-27 02:57:00,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 02:57:00,470 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 02:57:00,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:00,472 INFO L225 Difference]: With dead ends: 372 [2019-12-27 02:57:00,472 INFO L226 Difference]: Without dead ends: 221 [2019-12-27 02:57:00,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 02:57:00,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-12-27 02:57:00,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 197. [2019-12-27 02:57:00,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-12-27 02:57:00,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 339 transitions. [2019-12-27 02:57:00,477 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 339 transitions. Word has length 54 [2019-12-27 02:57:00,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:00,477 INFO L462 AbstractCegarLoop]: Abstraction has 197 states and 339 transitions. [2019-12-27 02:57:00,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 02:57:00,478 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 339 transitions. [2019-12-27 02:57:00,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 02:57:00,478 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:00,478 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 02:57:00,479 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:00,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:00,479 INFO L82 PathProgramCache]: Analyzing trace with hash 2120402622, now seen corresponding path program 2 times [2019-12-27 02:57:00,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:00,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151594592] [2019-12-27 02:57:00,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:00,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:00,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151594592] [2019-12-27 02:57:00,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:00,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:57:00,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829119315] [2019-12-27 02:57:00,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:57:00,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:00,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:57:00,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:57:00,759 INFO L87 Difference]: Start difference. First operand 197 states and 339 transitions. Second operand 13 states. [2019-12-27 02:57:01,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:01,193 INFO L93 Difference]: Finished difference Result 364 states and 617 transitions. [2019-12-27 02:57:01,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 02:57:01,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 02:57:01,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:01,197 INFO L225 Difference]: With dead ends: 364 [2019-12-27 02:57:01,197 INFO L226 Difference]: Without dead ends: 331 [2019-12-27 02:57:01,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-27 02:57:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-12-27 02:57:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 297. [2019-12-27 02:57:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-27 02:57:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 510 transitions. [2019-12-27 02:57:01,205 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 510 transitions. Word has length 54 [2019-12-27 02:57:01,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:01,206 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 510 transitions. [2019-12-27 02:57:01,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:57:01,206 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 510 transitions. [2019-12-27 02:57:01,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 02:57:01,207 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:01,207 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] [2019-12-27 02:57:01,207 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:01,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:01,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1229989646, now seen corresponding path program 3 times [2019-12-27 02:57:01,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:01,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539135877] [2019-12-27 02:57:01,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:01,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 02:57:01,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 02:57:01,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539135877] [2019-12-27 02:57:01,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 02:57:01,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 02:57:01,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277604201] [2019-12-27 02:57:01,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 02:57:01,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 02:57:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 02:57:01,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 02:57:01,580 INFO L87 Difference]: Start difference. First operand 297 states and 510 transitions. Second operand 13 states. [2019-12-27 02:57:02,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 02:57:02,034 INFO L93 Difference]: Finished difference Result 402 states and 671 transitions. [2019-12-27 02:57:02,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 02:57:02,035 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2019-12-27 02:57:02,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 02:57:02,038 INFO L225 Difference]: With dead ends: 402 [2019-12-27 02:57:02,039 INFO L226 Difference]: Without dead ends: 367 [2019-12-27 02:57:02,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2019-12-27 02:57:02,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2019-12-27 02:57:02,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 305. [2019-12-27 02:57:02,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-12-27 02:57:02,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 524 transitions. [2019-12-27 02:57:02,046 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 524 transitions. Word has length 54 [2019-12-27 02:57:02,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 02:57:02,046 INFO L462 AbstractCegarLoop]: Abstraction has 305 states and 524 transitions. [2019-12-27 02:57:02,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 02:57:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 524 transitions. [2019-12-27 02:57:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 02:57:02,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 02:57:02,048 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] [2019-12-27 02:57:02,048 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 02:57:02,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 02:57:02,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1631137646, now seen corresponding path program 4 times [2019-12-27 02:57:02,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 02:57:02,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432088694] [2019-12-27 02:57:02,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 02:57:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:57:02,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 02:57:02,134 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 02:57:02,135 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 02:57:02,139 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] ULTIMATE.startENTRY-->L779: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~x$r_buff0_thd0~0_317 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_153) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1447~0.base_22| 4)) (= (select .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22|) 0) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0)) |v_#memory_int_13|) (= 0 v_~x~0_144) (= v_~x$r_buff0_thd1~0_115 0) (= |v_ULTIMATE.start_main_~#t1447~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_78) (= v_~__unbuffered_p1_EAX~0_103 0) (= 0 v_~x$read_delayed~0_6) (< 0 |v_#StackHeapBarrier_14|) (= 0 v_~x$w_buff1_used~0_381) (= v_~x$flush_delayed~0_36 0) (= 0 |v_#NULL.base_4|) (= 0 v_~x$r_buff0_thd2~0_168) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1447~0.base_22|) (= 0 v_~x$w_buff1~0_166) (= |v_#NULL.offset_4| 0) (= v_~main$tmp_guard1~0_24 0) (= v_~y~0_67 0) (= 0 v_~x$w_buff0~0_193) (= v_~x$r_buff1_thd0~0_243 0) (= v_~main$tmp_guard0~0_24 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1447~0.base_22| 1) |v_#valid_47|) (= v_~weak$$choice2~0_114 0) (= 0 v_~weak$$choice0~0_12) (= 0 v_~x$w_buff0_used~0_609) (= v_~x$r_buff1_thd1~0_167 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_193, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_44|, ~x$flush_delayed~0=v_~x$flush_delayed~0_36, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_167, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_139|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_42|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_31|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_14|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_103, #length=|v_#length_15|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_317, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_29|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_31|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_19|, ~x$w_buff1~0=v_~x$w_buff1~0_166, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_28|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_381, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_153, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_37|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_32|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_31|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_27|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_17|, ~x~0=v_~x~0_144, ULTIMATE.start_main_~#t1447~0.offset=|v_ULTIMATE.start_main_~#t1447~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_115, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_25|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_23|, ULTIMATE.start_main_~#t1447~0.base=|v_ULTIMATE.start_main_~#t1447~0.base_22|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_24, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_40|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_25|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_32|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_36|, ~y~0=v_~y~0_67, ULTIMATE.start_main_#t~ite17=|v_ULTIMATE.start_main_#t~ite17_29|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_19|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_27|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_39|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_23|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_243, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_168, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_29|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_29|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_609, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_15|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_21|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, #NULL.offset, ULTIMATE.start_main_#t~ite26, ~x$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t1448~0.offset, ~__unbuffered_p1_EAX~0, #length, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~nondet15, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1448~0.base, ~x~0, ULTIMATE.start_main_~#t1447~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_~#t1447~0.base, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~y~0, ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 02:57:02,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [668] [668] L779-1-->L781: Formula: (and (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1448~0.base_10| 4) |v_#length_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10| 1)) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1448~0.base_10|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1448~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t1448~0.offset_9|) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1448~0.base_10|) |v_ULTIMATE.start_main_~#t1448~0.offset_9| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t1448~0.offset=|v_ULTIMATE.start_main_~#t1448~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t1448~0.base=|v_ULTIMATE.start_main_~#t1448~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1448~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1448~0.base] because there is no mapped edge [2019-12-27 02:57:02,140 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [623] [623] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_17| v_P1Thread1of1ForFork1_~arg.offset_17) (= 2 v_~x$w_buff0~0_54) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= 0 (mod v_~x$w_buff1_used~0_127 256)) (= 1 v_~x$w_buff0_used~0_216) (= v_~x$w_buff0~0_55 v_~x$w_buff1~0_48) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|) (= v_~x$w_buff0_used~0_217 v_~x$w_buff1_used~0_127) (= v_P1Thread1of1ForFork1_~arg.base_17 |v_P1Thread1of1ForFork1_#in~arg.base_17|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_55, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_217} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_19, ~x$w_buff0~0=v_~x$w_buff0~0_54, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_17, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_17|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_17, ~x$w_buff1~0=v_~x$w_buff1~0_48, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_17|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_17|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_127, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_216} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 02:57:02,142 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [650] [650] L728-2-->L728-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1629511365 256))) (.cse0 (= |P0Thread1of1ForFork0_#t~ite4_Out1629511365| |P0Thread1of1ForFork0_#t~ite3_Out1629511365|)) (.cse2 (= (mod ~x$w_buff1_used~0_In1629511365 256) 0))) (or (and (= ~x~0_In1629511365 |P0Thread1of1ForFork0_#t~ite3_Out1629511365|) .cse0 (or .cse1 .cse2)) (and (not .cse1) .cse0 (= ~x$w_buff1~0_In1629511365 |P0Thread1of1ForFork0_#t~ite3_Out1629511365|) (not .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1629511365, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1629511365, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1629511365, ~x~0=~x~0_In1629511365} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1629511365|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1629511365|, ~x$w_buff1~0=~x$w_buff1~0_In1629511365, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1629511365, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1629511365, ~x~0=~x~0_In1629511365} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 02:57:02,143 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [658] [658] L729-->L729-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-815496425 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-815496425 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-815496425|)) (and (= ~x$w_buff0_used~0_In-815496425 |P0Thread1of1ForFork0_#t~ite5_Out-815496425|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-815496425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815496425} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-815496425|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-815496425, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-815496425} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 02:57:02,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L730-->L730-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In-394585782 256))) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-394585782 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-394585782 256))) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-394585782 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-394585782| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-394585782| ~x$w_buff1_used~0_In-394585782) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-394585782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-394585782, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-394585782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-394585782} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-394585782|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-394585782, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-394585782, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-394585782, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-394585782} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 02:57:02,144 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [647] [647] L757-->L757-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd2~0_In1058095584 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In1058095584 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out1058095584| 0)) (and (= ~x$w_buff0_used~0_In1058095584 |P1Thread1of1ForFork1_#t~ite11_Out1058095584|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1058095584, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1058095584} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out1058095584|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1058095584, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1058095584} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 02:57:02,145 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L731-->L731-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1577934717 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1577934717 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite7_Out-1577934717| ~x$r_buff0_thd1~0_In-1577934717)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite7_Out-1577934717| 0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1577934717, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577934717} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1577934717, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1577934717|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1577934717} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 02:57:02,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [642] [642] L732-->L732-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In-1085808566 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1085808566 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1085808566 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1085808566 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1085808566| 0)) (and (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1085808566| ~x$r_buff1_thd1~0_In-1085808566) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1085808566, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1085808566, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1085808566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1085808566} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1085808566, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1085808566|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1085808566, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1085808566, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1085808566} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 02:57:02,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L732-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_125 |v_P0Thread1of1ForFork0_#t~ite8_38|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_37|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_125} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 02:57:02,146 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [655] [655] L758-->L758-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In776452286 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In776452286 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In776452286 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In776452286 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out776452286|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In776452286 |P1Thread1of1ForFork1_#t~ite12_Out776452286|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In776452286, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In776452286, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In776452286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In776452286} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In776452286, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In776452286, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out776452286|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In776452286, ~x$w_buff0_used~0=~x$w_buff0_used~0_In776452286} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 02:57:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [656] [656] L759-->L760: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-89802759 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-89802759 256) 0))) (or (and (= ~x$r_buff0_thd2~0_Out-89802759 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In-89802759 ~x$r_buff0_thd2~0_Out-89802759) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-89802759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-89802759} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-89802759|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-89802759, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-89802759} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 02:57:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [657] [657] L760-->L760-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In671677992 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In671677992 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In671677992 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In671677992 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out671677992|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd2~0_In671677992 |P1Thread1of1ForFork1_#t~ite14_Out671677992|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In671677992, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In671677992, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In671677992, ~x$w_buff0_used~0=~x$w_buff0_used~0_In671677992} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In671677992, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In671677992, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In671677992, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out671677992|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In671677992} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 02:57:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L760-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_125 |v_P1Thread1of1ForFork1_#t~ite14_36|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_36|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_125, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_35|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 02:57:02,147 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [586] [586] L781-1-->L787: Formula: (and (= 2 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet16, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 02:57:02,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L787-2-->L787-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite18_Out-2134266841| |ULTIMATE.start_main_#t~ite17_Out-2134266841|)) (.cse1 (= (mod ~x$w_buff1_used~0_In-2134266841 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In-2134266841 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite17_Out-2134266841| ~x$w_buff1~0_In-2134266841) (not .cse1) (not .cse2)) (and .cse0 (= ~x~0_In-2134266841 |ULTIMATE.start_main_#t~ite17_Out-2134266841|) (or .cse1 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2134266841, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2134266841, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2134266841, ~x~0=~x~0_In-2134266841} OutVars{ULTIMATE.start_main_#t~ite17=|ULTIMATE.start_main_#t~ite17_Out-2134266841|, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out-2134266841|, ~x$w_buff1~0=~x$w_buff1~0_In-2134266841, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2134266841, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2134266841, ~x~0=~x~0_In-2134266841} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite17, ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-27 02:57:02,148 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In1903575405 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In1903575405 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite19_Out1903575405|) (not .cse1)) (and (= ~x$w_buff0_used~0_In1903575405 |ULTIMATE.start_main_#t~ite19_Out1903575405|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1903575405, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1903575405} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1903575405, ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out1903575405|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1903575405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19] because there is no mapped edge [2019-12-27 02:57:02,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [643] [643] L789-->L789-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In910178386 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In910178386 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In910178386 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In910178386 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out910178386| ~x$w_buff1_used~0_In910178386) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite20_Out910178386|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In910178386, ~x$w_buff1_used~0=~x$w_buff1_used~0_In910178386, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In910178386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In910178386} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In910178386, ~x$w_buff1_used~0=~x$w_buff1_used~0_In910178386, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out910178386|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In910178386, ~x$w_buff0_used~0=~x$w_buff0_used~0_In910178386} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-27 02:57:02,149 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [661] [661] L790-->L790-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In498600799 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In498600799 256)))) (or (and (= |ULTIMATE.start_main_#t~ite21_Out498600799| ~x$r_buff0_thd0~0_In498600799) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite21_Out498600799| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In498600799, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498600799} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In498600799, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out498600799|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In498600799} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-27 02:57:02,150 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [653] [653] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In-862176165 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-862176165 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-862176165 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In-862176165 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In-862176165 |ULTIMATE.start_main_#t~ite22_Out-862176165|)) (and (= 0 |ULTIMATE.start_main_#t~ite22_Out-862176165|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-862176165, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-862176165, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-862176165, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-862176165} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-862176165, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-862176165, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-862176165, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-862176165|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-862176165} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-27 02:57:02,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L800-->L800-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-361006874 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite31_Out-361006874| |ULTIMATE.start_main_#t~ite32_Out-361006874|) (= |ULTIMATE.start_main_#t~ite31_Out-361006874| ~x$w_buff1~0_In-361006874) (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In-361006874 256) 0))) (or (= (mod ~x$w_buff0_used~0_In-361006874 256) 0) (and .cse1 (= (mod ~x$w_buff1_used~0_In-361006874 256) 0)) (and .cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-361006874 256)))))) (and (= |ULTIMATE.start_main_#t~ite32_Out-361006874| ~x$w_buff1~0_In-361006874) (not .cse0) (= |ULTIMATE.start_main_#t~ite31_In-361006874| |ULTIMATE.start_main_#t~ite31_Out-361006874|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-361006874, ~x$w_buff1~0=~x$w_buff1~0_In-361006874, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-361006874, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-361006874, ~weak$$choice2~0=~weak$$choice2~0_In-361006874, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_In-361006874|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-361006874} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-361006874, ~x$w_buff1~0=~x$w_buff1~0_In-361006874, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-361006874, ULTIMATE.start_main_#t~ite31=|ULTIMATE.start_main_#t~ite31_Out-361006874|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-361006874, ~weak$$choice2~0=~weak$$choice2~0_In-361006874, ULTIMATE.start_main_#t~ite32=|ULTIMATE.start_main_#t~ite32_Out-361006874|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-361006874} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite32] because there is no mapped edge [2019-12-27 02:57:02,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L803-->L804: Formula: (and (= v_~x$r_buff0_thd0~0_125 v_~x$r_buff0_thd0~0_124) (not (= (mod v_~weak$$choice2~0_35 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_125, ~weak$$choice2~0=v_~weak$$choice2~0_35} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_124, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_19|, ~weak$$choice2~0=v_~weak$$choice2~0_35} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-27 02:57:02,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L806-->L809-1: Formula: (and (not (= (mod v_~x$flush_delayed~0_27 256) 0)) (= v_~x$mem_tmp~0_15 v_~x~0_118) (= v_~x$flush_delayed~0_26 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_15 256))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_27, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~x$mem_tmp~0=v_~x$mem_tmp~0_15, ~x~0=v_~x~0_118, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[~x$flush_delayed~0, ~x~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 02:57:02,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L809-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_10 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-27 02:57:02,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 02:57:02 BasicIcfg [2019-12-27 02:57:02,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 02:57:02,233 INFO L168 Benchmark]: Toolchain (without parser) took 14531.38 ms. Allocated memory was 146.3 MB in the beginning and 447.7 MB in the end (delta: 301.5 MB). Free memory was 100.9 MB in the beginning and 128.8 MB in the end (delta: -27.9 MB). Peak memory consumption was 273.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:02,234 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 02:57:02,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 799.58 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 158.2 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:02,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.62 ms. Allocated memory is still 203.9 MB. Free memory was 158.2 MB in the beginning and 155.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:02,238 INFO L168 Benchmark]: Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:02,239 INFO L168 Benchmark]: RCFGBuilder took 771.86 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 109.3 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:02,239 INFO L168 Benchmark]: TraceAbstraction took 12843.78 ms. Allocated memory was 203.9 MB in the beginning and 447.7 MB in the end (delta: 243.8 MB). Free memory was 108.6 MB in the beginning and 128.8 MB in the end (delta: -20.1 MB). Peak memory consumption was 223.6 MB. Max. memory is 7.1 GB. [2019-12-27 02:57:02,248 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.46 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 799.58 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 100.7 MB in the beginning and 158.2 MB in the end (delta: -57.5 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.62 ms. Allocated memory is still 203.9 MB. Free memory was 158.2 MB in the beginning and 155.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.73 ms. Allocated memory is still 203.9 MB. Free memory was 155.6 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 771.86 ms. Allocated memory is still 203.9 MB. Free memory was 153.1 MB in the beginning and 109.3 MB in the end (delta: 43.8 MB). Peak memory consumption was 43.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12843.78 ms. Allocated memory was 203.9 MB in the beginning and 447.7 MB in the end (delta: 243.8 MB). Free memory was 108.6 MB in the beginning and 128.8 MB in the end (delta: -20.1 MB). Peak memory consumption was 223.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.6s, 146 ProgramPointsBefore, 78 ProgramPointsAfterwards, 180 TransitionsBefore, 90 TransitionsAfterwards, 10378 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 36 ConcurrentYvCompositions, 25 ChoiceCompositions, 3816 VarBasedMoverChecksPositive, 194 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 191 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 46078 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L779] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.6s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1486 SDtfs, 1408 SDslu, 3887 SDs, 0 SdLazy, 2252 SolverSat, 128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 27 SyntacticMatches, 15 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8413occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1163 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 685 NumberOfCodeBlocks, 685 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 616 ConstructedInterpolants, 0 QuantifiedInterpolants, 119685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...