/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:54:48,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:54:48,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:54:48,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:54:48,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:54:48,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:54:48,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:54:48,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:54:48,459 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:54:48,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:54:48,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:54:48,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:54:48,466 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:54:48,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:54:48,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:54:48,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:54:48,474 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:54:48,475 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:54:48,477 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:54:48,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:54:48,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:54:48,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:54:48,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:54:48,491 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:54:48,494 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:54:48,494 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:54:48,494 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:54:48,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:54:48,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:54:48,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:54:48,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:54:48,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:54:48,500 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:54:48,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:54:48,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:54:48,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:54:48,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:54:48,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:54:48,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:54:48,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:54:48,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:54:48,507 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:54:48,540 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:54:48,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:54:48,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:54:48,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:54:48,542 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:54:48,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:54:48,542 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:54:48,542 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:54:48,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:54:48,543 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:54:48,543 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:54:48,543 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:54:48,543 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:54:48,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:54:48,544 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:54:48,544 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:54:48,544 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:54:48,544 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:54:48,544 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:54:48,548 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:54:48,548 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:54:48,548 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:54:48,549 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:54:48,549 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:54:48,549 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:54:48,549 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:54:48,549 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:54:48,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:54:48,550 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:54:48,550 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:54:48,825 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:54:48,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:54:48,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:54:48,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:54:48,847 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:54:48,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i [2019-12-26 21:54:48,927 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22135a927/a2d374f494534ad2874d4978887aae93/FLAG282a7ac7a [2019-12-26 21:54:49,442 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:54:49,443 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_pso.opt.i [2019-12-26 21:54:49,477 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22135a927/a2d374f494534ad2874d4978887aae93/FLAG282a7ac7a [2019-12-26 21:54:49,752 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22135a927/a2d374f494534ad2874d4978887aae93 [2019-12-26 21:54:49,764 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:54:49,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:54:49,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:54:49,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:54:49,771 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:54:49,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:54:49" (1/1) ... [2019-12-26 21:54:49,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b25d38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:49, skipping insertion in model container [2019-12-26 21:54:49,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:54:49" (1/1) ... [2019-12-26 21:54:49,784 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:54:49,855 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:54:50,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:54:50,385 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:54:50,450 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:54:50,535 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:54:50,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50 WrapperNode [2019-12-26 21:54:50,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:54:50,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:54:50,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:54:50,537 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:54:50,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,595 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:54:50,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:54:50,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:54:50,595 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:54:50,603 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,603 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,628 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (1/1) ... [2019-12-26 21:54:50,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:54:50,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:54:50,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:54:50,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:54:50,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (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-26 21:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:54:50,689 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:54:50,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:54:50,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:54:50,690 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:54:50,690 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 21:54:50,691 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 21:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:54:50,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:54:50,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:54:50,693 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:54:51,392 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:54:51,392 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:54:51,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:54:51 BoogieIcfgContainer [2019-12-26 21:54:51,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:54:51,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:54:51,395 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:54:51,399 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:54:51,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:54:49" (1/3) ... [2019-12-26 21:54:51,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7060f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:54:51, skipping insertion in model container [2019-12-26 21:54:51,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:54:50" (2/3) ... [2019-12-26 21:54:51,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f7060f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:54:51, skipping insertion in model container [2019-12-26 21:54:51,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:54:51" (3/3) ... [2019-12-26 21:54:51,402 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_pso.opt.i [2019-12-26 21:54:51,412 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:54:51,413 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:54:51,422 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:54:51,423 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:54:51,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,479 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,479 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,479 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,480 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,482 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,493 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,494 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,495 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,496 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,497 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,498 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,499 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,501 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,502 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,502 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,503 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,503 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,504 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,505 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,506 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,507 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,508 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,509 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,509 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,509 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,510 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,511 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,512 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,513 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,514 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,517 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,518 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,518 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,519 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,519 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,522 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,523 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,523 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,523 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,525 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,526 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,527 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,527 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,528 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,529 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,530 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,530 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,533 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,533 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,534 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:54:51,549 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 21:54:51,569 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:54:51,569 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:54:51,570 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:54:51,570 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:54:51,570 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:54:51,570 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:54:51,570 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:54:51,570 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:54:51,587 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-26 21:54:51,589 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 21:54:51,734 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 21:54:51,734 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:54:51,752 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 21:54:51,773 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-26 21:54:51,844 INFO L132 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-26 21:54:51,844 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:54:51,851 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 205 events. 41/205 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 442 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 21:54:51,872 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-26 21:54:51,873 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:54:57,782 WARN L192 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-26 21:54:57,970 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-26 21:54:58,090 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-26 21:54:58,091 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-26 21:54:58,095 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-26 21:55:31,554 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-26 21:55:31,556 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-26 21:55:31,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:55:31,563 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:55:31,564 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:55:31,564 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:55:31,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:55:31,570 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-26 21:55:31,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:55:31,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464155653] [2019-12-26 21:55:31,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:55:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:55:31,871 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-26 21:55:31,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464155653] [2019-12-26 21:55:31,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:55:31,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:55:31,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115394075] [2019-12-26 21:55:31,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:55:31,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:55:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:55:31,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:55:31,890 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-26 21:55:36,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:55:36,221 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-26 21:55:36,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:55:36,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:55:36,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:55:37,183 INFO L225 Difference]: With dead ends: 158998 [2019-12-26 21:55:37,183 INFO L226 Difference]: Without dead ends: 149254 [2019-12-26 21:55:37,184 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-26 21:55:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-26 21:55:49,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-26 21:55:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-26 21:55:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-26 21:55:50,416 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-26 21:55:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:55:50,417 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-26 21:55:50,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:55:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-26 21:55:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:55:50,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:55:50,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:55:50,432 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:55:50,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:55:50,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-26 21:55:50,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:55:50,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123093641] [2019-12-26 21:55:50,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:55:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:55:50,499 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-26 21:55:50,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123093641] [2019-12-26 21:55:50,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:55:50,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:55:50,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036184172] [2019-12-26 21:55:50,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:55:50,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:55:50,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:55:50,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:55:50,503 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-26 21:55:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:55:56,710 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-26 21:55:56,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:55:56,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 21:55:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:55:57,119 INFO L225 Difference]: With dead ends: 94546 [2019-12-26 21:55:57,119 INFO L226 Difference]: Without dead ends: 94546 [2019-12-26 21:55:57,120 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-26 21:55:59,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-26 21:56:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-26 21:56:01,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-26 21:56:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-26 21:56:02,218 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-26 21:56:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:02,218 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-26 21:56:02,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:02,219 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-26 21:56:02,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:56:02,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:02,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:02,222 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:02,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:02,222 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-26 21:56:02,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:02,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530085595] [2019-12-26 21:56:02,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:02,306 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-26 21:56:02,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530085595] [2019-12-26 21:56:02,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:02,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:56:02,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369960793] [2019-12-26 21:56:02,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:56:02,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:02,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:56:02,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:56:02,311 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-26 21:56:03,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:03,328 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-26 21:56:03,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:56:03,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 21:56:03,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:08,903 INFO L225 Difference]: With dead ends: 144639 [2019-12-26 21:56:08,903 INFO L226 Difference]: Without dead ends: 144527 [2019-12-26 21:56:08,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:56:11,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-26 21:56:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-26 21:56:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-26 21:56:16,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-26 21:56:16,961 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-26 21:56:16,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:16,962 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-26 21:56:16,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:56:16,962 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-26 21:56:16,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:56:16,965 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:16,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:16,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:16,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:16,966 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-26 21:56:16,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:16,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825558595] [2019-12-26 21:56:16,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:17,026 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-26 21:56:17,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825558595] [2019-12-26 21:56:17,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:17,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:56:17,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955266587] [2019-12-26 21:56:17,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:56:17,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:17,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:56:17,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:56:17,028 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 4 states. [2019-12-26 21:56:17,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:17,194 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-26 21:56:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:56:17,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:56:17,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:17,263 INFO L225 Difference]: With dead ends: 37161 [2019-12-26 21:56:17,263 INFO L226 Difference]: Without dead ends: 37161 [2019-12-26 21:56:17,263 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-26 21:56:17,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-26 21:56:18,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-26 21:56:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-26 21:56:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-26 21:56:18,264 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-26 21:56:18,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:18,265 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-26 21:56:18,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:56:18,265 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-26 21:56:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:56:18,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:18,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:18,269 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:18,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-26 21:56:18,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:18,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886328475] [2019-12-26 21:56:18,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:18,397 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-26 21:56:18,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886328475] [2019-12-26 21:56:18,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:18,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:56:18,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819768628] [2019-12-26 21:56:18,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:56:18,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:18,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:56:18,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:56:18,400 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 5 states. [2019-12-26 21:56:18,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:18,937 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-26 21:56:18,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 21:56:18,938 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 21:56:18,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:19,483 INFO L225 Difference]: With dead ends: 54896 [2019-12-26 21:56:19,483 INFO L226 Difference]: Without dead ends: 54878 [2019-12-26 21:56:19,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:56:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-26 21:56:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-26 21:56:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-26 21:56:20,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-26 21:56:20,317 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-26 21:56:20,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:20,317 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-26 21:56:20,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:56:20,317 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-26 21:56:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 21:56:20,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:20,335 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] [2019-12-26 21:56:20,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:20,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:20,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-26 21:56:20,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:20,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497607824] [2019-12-26 21:56:20,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:20,417 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-26 21:56:20,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497607824] [2019-12-26 21:56:20,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:20,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:56:20,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337643950] [2019-12-26 21:56:20,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:56:20,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:20,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:56:20,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:56:20,419 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 6 states. [2019-12-26 21:56:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:21,451 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-26 21:56:21,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:56:21,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 21:56:21,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:21,578 INFO L225 Difference]: With dead ends: 65283 [2019-12-26 21:56:21,578 INFO L226 Difference]: Without dead ends: 65253 [2019-12-26 21:56:21,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 21:56:21,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-26 21:56:22,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-26 21:56:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-26 21:56:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-26 21:56:22,892 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-26 21:56:22,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:22,892 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-26 21:56:22,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:56:22,892 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-26 21:56:22,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:56:22,913 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:22,913 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] [2019-12-26 21:56:22,913 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:22,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-26 21:56:22,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:22,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757807895] [2019-12-26 21:56:22,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:22,976 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-26 21:56:22,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757807895] [2019-12-26 21:56:22,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:22,977 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:56:22,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053073171] [2019-12-26 21:56:22,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:56:22,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:22,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:56:22,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:56:22,979 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 5 states. [2019-12-26 21:56:23,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:23,132 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-26 21:56:23,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:56:23,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:56:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:23,178 INFO L225 Difference]: With dead ends: 23301 [2019-12-26 21:56:23,178 INFO L226 Difference]: Without dead ends: 23301 [2019-12-26 21:56:23,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:56:23,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-26 21:56:23,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-26 21:56:23,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-26 21:56:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-26 21:56:23,570 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-26 21:56:23,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:23,570 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-26 21:56:23,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:56:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-26 21:56:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 21:56:23,615 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:23,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:23,615 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:23,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-26 21:56:23,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:23,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228184998] [2019-12-26 21:56:23,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:23,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:23,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-26 21:56:23,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228184998] [2019-12-26 21:56:23,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:23,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:56:23,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434694950] [2019-12-26 21:56:23,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:56:23,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:23,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:56:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:23,719 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 3 states. [2019-12-26 21:56:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:23,882 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-26 21:56:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:56:23,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-26 21:56:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:23,925 INFO L225 Difference]: With dead ends: 34696 [2019-12-26 21:56:23,925 INFO L226 Difference]: Without dead ends: 23444 [2019-12-26 21:56:23,925 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-26 21:56:24,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-26 21:56:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-26 21:56:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-26 21:56:24,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-26 21:56:24,546 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-26 21:56:24,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:24,547 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-26 21:56:24,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:24,547 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-26 21:56:24,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 21:56:24,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:24,584 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] [2019-12-26 21:56:24,584 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:24,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:24,584 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-26 21:56:24,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:24,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253162638] [2019-12-26 21:56:24,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:24,668 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-26 21:56:24,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253162638] [2019-12-26 21:56:24,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:24,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:56:24,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499554037] [2019-12-26 21:56:24,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:56:24,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:24,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:56:24,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:56:24,670 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 6 states. [2019-12-26 21:56:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:24,781 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-26 21:56:24,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:56:24,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-26 21:56:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:24,799 INFO L225 Difference]: With dead ends: 21758 [2019-12-26 21:56:24,799 INFO L226 Difference]: Without dead ends: 11194 [2019-12-26 21:56:24,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:56:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-26 21:56:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-26 21:56:24,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-26 21:56:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-26 21:56:24,977 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-26 21:56:24,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:24,977 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-26 21:56:24,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:56:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-26 21:56:24,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:24,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:24,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:24,995 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:24,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:24,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-26 21:56:24,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:24,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479320997] [2019-12-26 21:56:24,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:25,051 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-26 21:56:25,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479320997] [2019-12-26 21:56:25,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:25,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:56:25,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396833976] [2019-12-26 21:56:25,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:56:25,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:25,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:56:25,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:25,053 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-26 21:56:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:25,143 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-26 21:56:25,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:56:25,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-26 21:56:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:25,170 INFO L225 Difference]: With dead ends: 14554 [2019-12-26 21:56:25,170 INFO L226 Difference]: Without dead ends: 14554 [2019-12-26 21:56:25,171 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-26 21:56:25,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-26 21:56:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-26 21:56:25,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-26 21:56:25,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-26 21:56:25,364 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-26 21:56:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:25,365 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-26 21:56:25,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:25,365 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-26 21:56:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:25,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:25,377 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:25,378 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-26 21:56:25,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:25,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849279142] [2019-12-26 21:56:25,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:25,460 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-26 21:56:25,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849279142] [2019-12-26 21:56:25,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:25,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:56:25,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598148779] [2019-12-26 21:56:25,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:56:25,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:25,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:56:25,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:56:25,463 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 4 states. [2019-12-26 21:56:25,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:25,550 INFO L93 Difference]: Finished difference Result 21477 states and 67702 transitions. [2019-12-26 21:56:25,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:56:25,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-26 21:56:25,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:25,569 INFO L225 Difference]: With dead ends: 21477 [2019-12-26 21:56:25,569 INFO L226 Difference]: Without dead ends: 9937 [2019-12-26 21:56:25,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:56:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-12-26 21:56:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2019-12-26 21:56:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9937 states. [2019-12-26 21:56:25,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 31212 transitions. [2019-12-26 21:56:25,777 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 31212 transitions. Word has length 57 [2019-12-26 21:56:25,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:25,777 INFO L462 AbstractCegarLoop]: Abstraction has 9937 states and 31212 transitions. [2019-12-26 21:56:25,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:56:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 31212 transitions. [2019-12-26 21:56:25,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:25,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:25,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:25,789 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:25,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:25,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-26 21:56:25,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:25,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448620658] [2019-12-26 21:56:25,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:25,885 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-26 21:56:25,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448620658] [2019-12-26 21:56:25,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:25,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:56:25,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201825828] [2019-12-26 21:56:25,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:56:25,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:25,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:56:25,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:56:25,887 INFO L87 Difference]: Start difference. First operand 9937 states and 31212 transitions. Second operand 7 states. [2019-12-26 21:56:26,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:26,261 INFO L93 Difference]: Finished difference Result 26843 states and 84141 transitions. [2019-12-26 21:56:26,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:56:26,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 21:56:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:26,291 INFO L225 Difference]: With dead ends: 26843 [2019-12-26 21:56:26,291 INFO L226 Difference]: Without dead ends: 20587 [2019-12-26 21:56:26,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:56:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20587 states. [2019-12-26 21:56:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20587 to 12177. [2019-12-26 21:56:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-12-26 21:56:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 38516 transitions. [2019-12-26 21:56:26,531 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 38516 transitions. Word has length 57 [2019-12-26 21:56:26,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:26,531 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 38516 transitions. [2019-12-26 21:56:26,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:56:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 38516 transitions. [2019-12-26 21:56:26,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:26,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:26,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:26,551 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:26,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:26,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-26 21:56:26,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:26,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017258650] [2019-12-26 21:56:26,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:26,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:26,644 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-26 21:56:26,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017258650] [2019-12-26 21:56:26,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:26,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:56:26,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815001011] [2019-12-26 21:56:26,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:56:26,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:56:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:56:26,646 INFO L87 Difference]: Start difference. First operand 12177 states and 38516 transitions. Second operand 7 states. [2019-12-26 21:56:27,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:27,431 INFO L93 Difference]: Finished difference Result 33666 states and 104259 transitions. [2019-12-26 21:56:27,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:56:27,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 21:56:27,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:27,471 INFO L225 Difference]: With dead ends: 33666 [2019-12-26 21:56:27,471 INFO L226 Difference]: Without dead ends: 24086 [2019-12-26 21:56:27,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 21:56:27,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2019-12-26 21:56:27,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 15349. [2019-12-26 21:56:27,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15349 states. [2019-12-26 21:56:27,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 48528 transitions. [2019-12-26 21:56:27,774 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 48528 transitions. Word has length 57 [2019-12-26 21:56:27,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:27,774 INFO L462 AbstractCegarLoop]: Abstraction has 15349 states and 48528 transitions. [2019-12-26 21:56:27,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:56:27,775 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 48528 transitions. [2019-12-26 21:56:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:27,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:27,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:27,797 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:27,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:27,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-26 21:56:27,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:27,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396729904] [2019-12-26 21:56:27,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:27,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:27,901 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-26 21:56:27,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396729904] [2019-12-26 21:56:27,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:27,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 21:56:27,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196560405] [2019-12-26 21:56:27,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:56:27,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:56:27,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:56:27,903 INFO L87 Difference]: Start difference. First operand 15349 states and 48528 transitions. Second operand 8 states. [2019-12-26 21:56:28,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:28,913 INFO L93 Difference]: Finished difference Result 34932 states and 106981 transitions. [2019-12-26 21:56:28,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:56:28,914 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-26 21:56:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:28,963 INFO L225 Difference]: With dead ends: 34932 [2019-12-26 21:56:28,963 INFO L226 Difference]: Without dead ends: 32668 [2019-12-26 21:56:28,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:56:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2019-12-26 21:56:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 15407. [2019-12-26 21:56:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2019-12-26 21:56:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 48800 transitions. [2019-12-26 21:56:29,350 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 48800 transitions. Word has length 57 [2019-12-26 21:56:29,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:29,350 INFO L462 AbstractCegarLoop]: Abstraction has 15407 states and 48800 transitions. [2019-12-26 21:56:29,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:56:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 48800 transitions. [2019-12-26 21:56:29,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:29,368 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:29,369 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:29,369 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash -979581959, now seen corresponding path program 5 times [2019-12-26 21:56:29,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:29,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95765211] [2019-12-26 21:56:29,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:29,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:56:29,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95765211] [2019-12-26 21:56:29,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:29,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:56:29,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421420700] [2019-12-26 21:56:29,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:56:29,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:29,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:56:29,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:56:29,491 INFO L87 Difference]: Start difference. First operand 15407 states and 48800 transitions. Second operand 9 states. [2019-12-26 21:56:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:30,886 INFO L93 Difference]: Finished difference Result 48430 states and 148036 transitions. [2019-12-26 21:56:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:56:30,886 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 21:56:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:30,955 INFO L225 Difference]: With dead ends: 48430 [2019-12-26 21:56:30,955 INFO L226 Difference]: Without dead ends: 46166 [2019-12-26 21:56:30,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:56:31,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46166 states. [2019-12-26 21:56:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46166 to 15428. [2019-12-26 21:56:31,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2019-12-26 21:56:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 48880 transitions. [2019-12-26 21:56:31,662 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 48880 transitions. Word has length 57 [2019-12-26 21:56:31,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:31,662 INFO L462 AbstractCegarLoop]: Abstraction has 15428 states and 48880 transitions. [2019-12-26 21:56:31,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:56:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 48880 transitions. [2019-12-26 21:56:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:31,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:31,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:31,681 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:31,681 INFO L82 PathProgramCache]: Analyzing trace with hash -2032569873, now seen corresponding path program 6 times [2019-12-26 21:56:31,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:31,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288626331] [2019-12-26 21:56:31,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:31,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:31,803 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-26 21:56:31,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288626331] [2019-12-26 21:56:31,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:31,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:56:31,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181301064] [2019-12-26 21:56:31,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:56:31,805 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:31,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:56:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:56:31,805 INFO L87 Difference]: Start difference. First operand 15428 states and 48880 transitions. Second operand 9 states. [2019-12-26 21:56:33,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:33,364 INFO L93 Difference]: Finished difference Result 62597 states and 191406 transitions. [2019-12-26 21:56:33,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 21:56:33,364 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 21:56:33,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:33,451 INFO L225 Difference]: With dead ends: 62597 [2019-12-26 21:56:33,452 INFO L226 Difference]: Without dead ends: 54167 [2019-12-26 21:56:33,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=347, Invalid=985, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 21:56:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-26 21:56:34,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 19382. [2019-12-26 21:56:34,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19382 states. [2019-12-26 21:56:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 61433 transitions. [2019-12-26 21:56:34,072 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 61433 transitions. Word has length 57 [2019-12-26 21:56:34,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:34,073 INFO L462 AbstractCegarLoop]: Abstraction has 19382 states and 61433 transitions. [2019-12-26 21:56:34,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:56:34,073 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 61433 transitions. [2019-12-26 21:56:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:56:34,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:34,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:56:34,093 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:34,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 7 times [2019-12-26 21:56:34,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:34,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498628985] [2019-12-26 21:56:34,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:34,185 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-26 21:56:34,185 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498628985] [2019-12-26 21:56:34,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:34,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:56:34,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324229780] [2019-12-26 21:56:34,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:56:34,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:34,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:56:34,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:34,188 INFO L87 Difference]: Start difference. First operand 19382 states and 61433 transitions. Second operand 3 states. [2019-12-26 21:56:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:34,267 INFO L93 Difference]: Finished difference Result 16496 states and 51087 transitions. [2019-12-26 21:56:34,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:56:34,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-26 21:56:34,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:34,296 INFO L225 Difference]: With dead ends: 16496 [2019-12-26 21:56:34,296 INFO L226 Difference]: Without dead ends: 16496 [2019-12-26 21:56:34,297 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-26 21:56:34,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16496 states. [2019-12-26 21:56:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16496 to 15921. [2019-12-26 21:56:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15921 states. [2019-12-26 21:56:34,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 49194 transitions. [2019-12-26 21:56:34,537 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 49194 transitions. Word has length 57 [2019-12-26 21:56:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:34,537 INFO L462 AbstractCegarLoop]: Abstraction has 15921 states and 49194 transitions. [2019-12-26 21:56:34,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 49194 transitions. [2019-12-26 21:56:34,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:34,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:34,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:34,557 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:34,557 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-26 21:56:34,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:34,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201205401] [2019-12-26 21:56:34,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:34,821 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-26 21:56:34,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201205401] [2019-12-26 21:56:34,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:34,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:34,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117218725] [2019-12-26 21:56:34,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:34,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:34,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:34,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:34,829 INFO L87 Difference]: Start difference. First operand 15921 states and 49194 transitions. Second operand 11 states. [2019-12-26 21:56:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:37,641 INFO L93 Difference]: Finished difference Result 33289 states and 102035 transitions. [2019-12-26 21:56:37,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 21:56:37,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-26 21:56:37,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:37,677 INFO L225 Difference]: With dead ends: 33289 [2019-12-26 21:56:37,677 INFO L226 Difference]: Without dead ends: 23951 [2019-12-26 21:56:37,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=795, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:56:37,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2019-12-26 21:56:37,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 16786. [2019-12-26 21:56:37,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16786 states. [2019-12-26 21:56:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16786 states to 16786 states and 51436 transitions. [2019-12-26 21:56:37,995 INFO L78 Accepts]: Start accepts. Automaton has 16786 states and 51436 transitions. Word has length 58 [2019-12-26 21:56:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:37,995 INFO L462 AbstractCegarLoop]: Abstraction has 16786 states and 51436 transitions. [2019-12-26 21:56:37,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 16786 states and 51436 transitions. [2019-12-26 21:56:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:38,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:38,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:38,013 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:38,014 INFO L82 PathProgramCache]: Analyzing trace with hash 540759914, now seen corresponding path program 2 times [2019-12-26 21:56:38,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:38,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355197156] [2019-12-26 21:56:38,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:38,136 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-26 21:56:38,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355197156] [2019-12-26 21:56:38,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:38,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:56:38,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91436675] [2019-12-26 21:56:38,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:56:38,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:38,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:56:38,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:56:38,138 INFO L87 Difference]: Start difference. First operand 16786 states and 51436 transitions. Second operand 8 states. [2019-12-26 21:56:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:39,853 INFO L93 Difference]: Finished difference Result 29302 states and 86887 transitions. [2019-12-26 21:56:39,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:56:39,853 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-26 21:56:39,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:39,895 INFO L225 Difference]: With dead ends: 29302 [2019-12-26 21:56:39,895 INFO L226 Difference]: Without dead ends: 29080 [2019-12-26 21:56:39,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=660, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:56:39,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29080 states. [2019-12-26 21:56:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29080 to 20735. [2019-12-26 21:56:40,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-26 21:56:40,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 63126 transitions. [2019-12-26 21:56:40,279 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 63126 transitions. Word has length 58 [2019-12-26 21:56:40,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:40,279 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 63126 transitions. [2019-12-26 21:56:40,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:56:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 63126 transitions. [2019-12-26 21:56:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:40,302 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:40,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:40,302 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:40,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:40,303 INFO L82 PathProgramCache]: Analyzing trace with hash 755166698, now seen corresponding path program 3 times [2019-12-26 21:56:40,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:40,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707892726] [2019-12-26 21:56:40,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:40,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:40,499 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-26 21:56:40,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707892726] [2019-12-26 21:56:40,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:40,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:40,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697754047] [2019-12-26 21:56:40,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:40,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:40,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:40,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:40,501 INFO L87 Difference]: Start difference. First operand 20735 states and 63126 transitions. Second operand 11 states. [2019-12-26 21:56:42,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:42,632 INFO L93 Difference]: Finished difference Result 32233 states and 97204 transitions. [2019-12-26 21:56:42,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 21:56:42,633 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-26 21:56:42,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:42,670 INFO L225 Difference]: With dead ends: 32233 [2019-12-26 21:56:42,670 INFO L226 Difference]: Without dead ends: 27963 [2019-12-26 21:56:42,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2019-12-26 21:56:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27963 states. [2019-12-26 21:56:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27963 to 20789. [2019-12-26 21:56:42,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20789 states. [2019-12-26 21:56:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20789 states to 20789 states and 63080 transitions. [2019-12-26 21:56:43,019 INFO L78 Accepts]: Start accepts. Automaton has 20789 states and 63080 transitions. Word has length 58 [2019-12-26 21:56:43,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:43,019 INFO L462 AbstractCegarLoop]: Abstraction has 20789 states and 63080 transitions. [2019-12-26 21:56:43,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 20789 states and 63080 transitions. [2019-12-26 21:56:43,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:43,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:43,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:43,040 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:43,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:43,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1780291492, now seen corresponding path program 4 times [2019-12-26 21:56:43,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:43,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595208477] [2019-12-26 21:56:43,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:43,472 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-26 21:56:43,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595208477] [2019-12-26 21:56:43,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:43,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-26 21:56:43,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974179575] [2019-12-26 21:56:43,473 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-26 21:56:43,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:43,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-26 21:56:43,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-12-26 21:56:43,474 INFO L87 Difference]: Start difference. First operand 20789 states and 63080 transitions. Second operand 18 states. [2019-12-26 21:56:47,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:47,742 INFO L93 Difference]: Finished difference Result 23732 states and 71431 transitions. [2019-12-26 21:56:47,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-12-26 21:56:47,743 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2019-12-26 21:56:47,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:47,773 INFO L225 Difference]: With dead ends: 23732 [2019-12-26 21:56:47,773 INFO L226 Difference]: Without dead ends: 22456 [2019-12-26 21:56:47,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=375, Invalid=2277, Unknown=0, NotChecked=0, Total=2652 [2019-12-26 21:56:47,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22456 states. [2019-12-26 21:56:48,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22456 to 21004. [2019-12-26 21:56:48,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21004 states. [2019-12-26 21:56:48,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21004 states to 21004 states and 63622 transitions. [2019-12-26 21:56:48,073 INFO L78 Accepts]: Start accepts. Automaton has 21004 states and 63622 transitions. Word has length 58 [2019-12-26 21:56:48,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:48,073 INFO L462 AbstractCegarLoop]: Abstraction has 21004 states and 63622 transitions. [2019-12-26 21:56:48,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-26 21:56:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21004 states and 63622 transitions. [2019-12-26 21:56:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:48,093 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:48,093 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 21:56:48,094 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:48,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:48,094 INFO L82 PathProgramCache]: Analyzing trace with hash 2015607172, now seen corresponding path program 5 times [2019-12-26 21:56:48,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:48,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443591006] [2019-12-26 21:56:48,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:48,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:48,404 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-26 21:56:48,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443591006] [2019-12-26 21:56:48,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:48,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-26 21:56:48,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921785762] [2019-12-26 21:56:48,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-26 21:56:48,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-26 21:56:48,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-26 21:56:48,408 INFO L87 Difference]: Start difference. First operand 21004 states and 63622 transitions. Second operand 15 states. [2019-12-26 21:56:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:51,472 INFO L93 Difference]: Finished difference Result 25134 states and 75340 transitions. [2019-12-26 21:56:51,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-26 21:56:51,473 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2019-12-26 21:56:51,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:51,506 INFO L225 Difference]: With dead ends: 25134 [2019-12-26 21:56:51,506 INFO L226 Difference]: Without dead ends: 23924 [2019-12-26 21:56:51,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2019-12-26 21:56:51,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23924 states. [2019-12-26 21:56:51,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23924 to 20959. [2019-12-26 21:56:51,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20959 states. [2019-12-26 21:56:51,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20959 states to 20959 states and 63514 transitions. [2019-12-26 21:56:51,827 INFO L78 Accepts]: Start accepts. Automaton has 20959 states and 63514 transitions. Word has length 58 [2019-12-26 21:56:51,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:51,828 INFO L462 AbstractCegarLoop]: Abstraction has 20959 states and 63514 transitions. [2019-12-26 21:56:51,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-26 21:56:51,828 INFO L276 IsEmpty]: Start isEmpty. Operand 20959 states and 63514 transitions. [2019-12-26 21:56:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:51,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:51,849 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:51,849 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash 207625526, now seen corresponding path program 6 times [2019-12-26 21:56:51,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:51,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634951017] [2019-12-26 21:56:51,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:52,005 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-26 21:56:52,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634951017] [2019-12-26 21:56:52,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:52,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:52,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866482288] [2019-12-26 21:56:52,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:52,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:52,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:52,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:52,007 INFO L87 Difference]: Start difference. First operand 20959 states and 63514 transitions. Second operand 11 states. [2019-12-26 21:56:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:53,488 INFO L93 Difference]: Finished difference Result 29769 states and 89624 transitions. [2019-12-26 21:56:53,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:56:53,488 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-26 21:56:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:53,528 INFO L225 Difference]: With dead ends: 29769 [2019-12-26 21:56:53,528 INFO L226 Difference]: Without dead ends: 28128 [2019-12-26 21:56:53,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2019-12-26 21:56:53,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28128 states. [2019-12-26 21:56:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28128 to 20865. [2019-12-26 21:56:53,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20865 states. [2019-12-26 21:56:53,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20865 states to 20865 states and 63238 transitions. [2019-12-26 21:56:53,892 INFO L78 Accepts]: Start accepts. Automaton has 20865 states and 63238 transitions. Word has length 58 [2019-12-26 21:56:53,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:53,893 INFO L462 AbstractCegarLoop]: Abstraction has 20865 states and 63238 transitions. [2019-12-26 21:56:53,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:53,893 INFO L276 IsEmpty]: Start isEmpty. Operand 20865 states and 63238 transitions. [2019-12-26 21:56:53,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:53,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:53,914 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:53,915 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:53,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:53,915 INFO L82 PathProgramCache]: Analyzing trace with hash -199714182, now seen corresponding path program 7 times [2019-12-26 21:56:53,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:53,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488673385] [2019-12-26 21:56:53,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:53,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:54,046 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-26 21:56:54,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488673385] [2019-12-26 21:56:54,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:54,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:54,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965135722] [2019-12-26 21:56:54,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:54,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:54,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:54,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:54,050 INFO L87 Difference]: Start difference. First operand 20865 states and 63238 transitions. Second operand 11 states. [2019-12-26 21:56:56,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:56,132 INFO L93 Difference]: Finished difference Result 30585 states and 91967 transitions. [2019-12-26 21:56:56,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:56:56,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-26 21:56:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:56,172 INFO L225 Difference]: With dead ends: 30585 [2019-12-26 21:56:56,172 INFO L226 Difference]: Without dead ends: 29521 [2019-12-26 21:56:56,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:56:56,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29521 states. [2019-12-26 21:56:56,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29521 to 20677. [2019-12-26 21:56:56,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20677 states. [2019-12-26 21:56:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20677 states to 20677 states and 62762 transitions. [2019-12-26 21:56:56,543 INFO L78 Accepts]: Start accepts. Automaton has 20677 states and 62762 transitions. Word has length 58 [2019-12-26 21:56:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:56,544 INFO L462 AbstractCegarLoop]: Abstraction has 20677 states and 62762 transitions. [2019-12-26 21:56:56,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 20677 states and 62762 transitions. [2019-12-26 21:56:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:56:56,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:56,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:56,567 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:56,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:56,567 INFO L82 PathProgramCache]: Analyzing trace with hash -2078538356, now seen corresponding path program 8 times [2019-12-26 21:56:56,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:56,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367356307] [2019-12-26 21:56:56,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:56,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:56,635 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-26 21:56:56,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367356307] [2019-12-26 21:56:56,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:56,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:56:56,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290382962] [2019-12-26 21:56:56,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:56:56,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:56,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:56:56,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:56:56,637 INFO L87 Difference]: Start difference. First operand 20677 states and 62762 transitions. Second operand 3 states. [2019-12-26 21:56:56,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:56,724 INFO L93 Difference]: Finished difference Result 20677 states and 62760 transitions. [2019-12-26 21:56:56,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:56:56,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 21:56:56,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:56,763 INFO L225 Difference]: With dead ends: 20677 [2019-12-26 21:56:56,764 INFO L226 Difference]: Without dead ends: 20677 [2019-12-26 21:56:56,764 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-26 21:56:56,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20677 states. [2019-12-26 21:56:57,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20677 to 17662. [2019-12-26 21:56:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17662 states. [2019-12-26 21:56:57,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17662 states to 17662 states and 54496 transitions. [2019-12-26 21:56:57,281 INFO L78 Accepts]: Start accepts. Automaton has 17662 states and 54496 transitions. Word has length 58 [2019-12-26 21:56:57,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:57,281 INFO L462 AbstractCegarLoop]: Abstraction has 17662 states and 54496 transitions. [2019-12-26 21:56:57,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:56:57,281 INFO L276 IsEmpty]: Start isEmpty. Operand 17662 states and 54496 transitions. [2019-12-26 21:56:57,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:56:57,316 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:57,316 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:57,317 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:57,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:57,317 INFO L82 PathProgramCache]: Analyzing trace with hash 235346217, now seen corresponding path program 1 times [2019-12-26 21:56:57,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:57,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46260945] [2019-12-26 21:56:57,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:57,659 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-26 21:56:57,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46260945] [2019-12-26 21:56:57,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:57,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:57,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042094579] [2019-12-26 21:56:57,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:57,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:57,662 INFO L87 Difference]: Start difference. First operand 17662 states and 54496 transitions. Second operand 11 states. [2019-12-26 21:56:58,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:56:58,668 INFO L93 Difference]: Finished difference Result 31928 states and 98523 transitions. [2019-12-26 21:56:58,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:56:58,668 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 21:56:58,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:56:58,716 INFO L225 Difference]: With dead ends: 31928 [2019-12-26 21:56:58,716 INFO L226 Difference]: Without dead ends: 31362 [2019-12-26 21:56:58,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=758, Unknown=0, NotChecked=0, Total=930 [2019-12-26 21:56:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31362 states. [2019-12-26 21:56:59,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31362 to 20496. [2019-12-26 21:56:59,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20496 states. [2019-12-26 21:56:59,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20496 states to 20496 states and 63318 transitions. [2019-12-26 21:56:59,126 INFO L78 Accepts]: Start accepts. Automaton has 20496 states and 63318 transitions. Word has length 59 [2019-12-26 21:56:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:56:59,127 INFO L462 AbstractCegarLoop]: Abstraction has 20496 states and 63318 transitions. [2019-12-26 21:56:59,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:56:59,127 INFO L276 IsEmpty]: Start isEmpty. Operand 20496 states and 63318 transitions. [2019-12-26 21:56:59,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:56:59,150 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:56:59,151 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:56:59,151 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:56:59,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:56:59,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1674144661, now seen corresponding path program 2 times [2019-12-26 21:56:59,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:56:59,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124759595] [2019-12-26 21:56:59,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:56:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:56:59,384 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-26 21:56:59,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124759595] [2019-12-26 21:56:59,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:56:59,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:56:59,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468462024] [2019-12-26 21:56:59,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:56:59,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:56:59,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:56:59,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:56:59,386 INFO L87 Difference]: Start difference. First operand 20496 states and 63318 transitions. Second operand 11 states. [2019-12-26 21:57:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:57:00,308 INFO L93 Difference]: Finished difference Result 31968 states and 97963 transitions. [2019-12-26 21:57:00,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:57:00,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 21:57:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:57:00,349 INFO L225 Difference]: With dead ends: 31968 [2019-12-26 21:57:00,349 INFO L226 Difference]: Without dead ends: 26807 [2019-12-26 21:57:00,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:57:00,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26807 states. [2019-12-26 21:57:00,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26807 to 17228. [2019-12-26 21:57:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17228 states. [2019-12-26 21:57:00,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17228 states to 17228 states and 53135 transitions. [2019-12-26 21:57:00,888 INFO L78 Accepts]: Start accepts. Automaton has 17228 states and 53135 transitions. Word has length 59 [2019-12-26 21:57:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:57:00,888 INFO L462 AbstractCegarLoop]: Abstraction has 17228 states and 53135 transitions. [2019-12-26 21:57:00,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:57:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 17228 states and 53135 transitions. [2019-12-26 21:57:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:57:00,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:57:00,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:57:00,909 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:57:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:57:00,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1304528589, now seen corresponding path program 3 times [2019-12-26 21:57:00,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:57:00,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591600026] [2019-12-26 21:57:00,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:57:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:57:01,162 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-26 21:57:01,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591600026] [2019-12-26 21:57:01,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:57:01,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:57:01,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233530153] [2019-12-26 21:57:01,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:57:01,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:57:01,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:57:01,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:57:01,165 INFO L87 Difference]: Start difference. First operand 17228 states and 53135 transitions. Second operand 11 states. [2019-12-26 21:57:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:57:02,282 INFO L93 Difference]: Finished difference Result 27363 states and 83789 transitions. [2019-12-26 21:57:02,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 21:57:02,282 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-26 21:57:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:57:02,321 INFO L225 Difference]: With dead ends: 27363 [2019-12-26 21:57:02,321 INFO L226 Difference]: Without dead ends: 26594 [2019-12-26 21:57:02,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:57:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26594 states. [2019-12-26 21:57:02,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26594 to 16678. [2019-12-26 21:57:02,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16678 states. [2019-12-26 21:57:02,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16678 states to 16678 states and 51651 transitions. [2019-12-26 21:57:02,644 INFO L78 Accepts]: Start accepts. Automaton has 16678 states and 51651 transitions. Word has length 59 [2019-12-26 21:57:02,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:57:02,644 INFO L462 AbstractCegarLoop]: Abstraction has 16678 states and 51651 transitions. [2019-12-26 21:57:02,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:57:02,644 INFO L276 IsEmpty]: Start isEmpty. Operand 16678 states and 51651 transitions. [2019-12-26 21:57:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:57:02,662 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:57:02,662 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:57:02,662 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:57:02,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:57:02,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 4 times [2019-12-26 21:57:02,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:57:02,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762272381] [2019-12-26 21:57:02,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:57:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:57:02,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:57:02,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:57:02,828 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:57:02,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] ULTIMATE.startENTRY-->L846: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~__unbuffered_p1_EBX~0_48 0) (= v_~x~0_72 0) (= v_~y$w_buff1_used~0_529 0) (= v_~main$tmp_guard0~0_30 0) (= v_~y$r_buff1_thd1~0_122 0) (= 0 v_~y$w_buff0~0_386) (= 0 v_~y$r_buff0_thd2~0_330) (= v_~__unbuffered_cnt~0_187 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t613~0.base_29| 4) |v_#length_31|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t613~0.base_29|)) (= v_~main$tmp_guard1~0_42 0) (< 0 |v_#StackHeapBarrier_22|) (= v_~y~0_163 0) (= v_~y$read_delayed~0_7 0) (= 0 |v_ULTIMATE.start_main_~#t613~0.offset_21|) (= 0 v_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= 0 v_~y$flush_delayed~0_49) (= 0 v_~y$read_delayed_var~0.base_5) (= v_~y$r_buff0_thd1~0_36 0) (= v_~y$w_buff0_used~0_832 0) (= 0 v_~y$read_delayed_var~0.offset_5) (= 0 v_~y$r_buff1_thd4~0_202) (= v_~a~0_49 0) (= 0 v_~y$r_buff1_thd2~0_315) (= v_~y$r_buff0_thd0~0_117 0) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t613~0.base_29| 1)) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t613~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t613~0.base_29|) |v_ULTIMATE.start_main_~#t613~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~weak$$choice0~0_22) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t613~0.base_29|) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= 0 v_~__unbuffered_p1_EAX~0_47) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= v_~weak$$choice2~0_186 0) (= v_~y$r_buff1_thd0~0_220 0) (= v_~z~0_163 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_22|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_30|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_~#t615~0.offset=|v_ULTIMATE.start_main_~#t615~0.offset_21|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, ULTIMATE.start_main_~#t616~0.base=|v_ULTIMATE.start_main_~#t616~0.base_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_~#t613~0.base=|v_ULTIMATE.start_main_~#t613~0.base_29|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_49, ~y$mem_tmp~0=v_~y$mem_tmp~0_24, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_189, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_36, ~y$flush_delayed~0=v_~y$flush_delayed~0_49, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_48, #length=|v_#length_31|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_29|, ~weak$$choice0~0=v_~weak$$choice0~0_22, #StackHeapBarrier=|v_#StackHeapBarrier_22|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_202, ~y$w_buff1~0=v_~y$w_buff1~0_278, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_330, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_187, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_220, ~x~0=v_~x~0_72, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_832, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_41|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_63|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_39|, ULTIMATE.start_main_~#t615~0.base=|v_ULTIMATE.start_main_~#t615~0.base_29|, ULTIMATE.start_main_~#t616~0.offset=|v_ULTIMATE.start_main_~#t616~0.offset_16|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ~y~0=v_~y~0_163, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_48, ULTIMATE.start_main_~#t613~0.offset=|v_ULTIMATE.start_main_~#t613~0.offset_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_30, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_48, #NULL.base=|v_#NULL.base_4|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_315, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_120, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_26|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_117, #valid=|v_#valid_72|, ULTIMATE.start_main_~#t614~0.offset=|v_ULTIMATE.start_main_~#t614~0.offset_21|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_163, ULTIMATE.start_main_~#t614~0.base=|v_ULTIMATE.start_main_~#t614~0.base_29|, ~weak$$choice2~0=v_~weak$$choice2~0_186, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_529} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t615~0.offset, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t616~0.base, #NULL.offset, ULTIMATE.start_main_~#t613~0.base, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet41, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t615~0.base, ULTIMATE.start_main_~#t616~0.offset, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t613~0.offset, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t614~0.offset, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t614~0.base, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:57:02,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t614~0.offset_10|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t614~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t614~0.base_12|) |v_ULTIMATE.start_main_~#t614~0.offset_10| 1)) |v_#memory_int_17|) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t614~0.base_12| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t614~0.base_12|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t614~0.base_12| 4) |v_#length_19|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t614~0.base_12|)) (not (= |v_ULTIMATE.start_main_~#t614~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t614~0.offset=|v_ULTIMATE.start_main_~#t614~0.offset_10|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t614~0.base=|v_ULTIMATE.start_main_~#t614~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t614~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t614~0.base] because there is no mapped edge [2019-12-26 21:57:02,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t615~0.base_13|)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t615~0.base_13|) 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t615~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t615~0.offset_11|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t615~0.base_13|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t615~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t615~0.base_13|) |v_ULTIMATE.start_main_~#t615~0.offset_11| 2)) |v_#memory_int_21|) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t615~0.base_13| 4) |v_#length_23|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t615~0.base=|v_ULTIMATE.start_main_~#t615~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t615~0.offset=|v_ULTIMATE.start_main_~#t615~0.offset_11|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t615~0.base, ULTIMATE.start_main_~#t615~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 21:57:02,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L4-->L800: Formula: (and (= v_~y$r_buff0_thd4~0_25 v_~y$r_buff1_thd4~0_25) (= v_~y$r_buff0_thd3~0_17 1) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24 0)) (= v_~y$r_buff0_thd3~0_18 v_~y$r_buff1_thd3~0_11) (= v_~y$r_buff1_thd1~0_4 v_~y$r_buff0_thd1~0_4) (= v_~y$r_buff0_thd2~0_68 v_~y$r_buff1_thd2~0_32) (= v_~z~0_10 1) (= v_~y$r_buff0_thd0~0_19 v_~y$r_buff1_thd0~0_17)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_18, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_32, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_25, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_4, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_11, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_17, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_68, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_4, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_24, ~z~0=v_~z~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_17} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-26 21:57:02,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t616~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t616~0.base_10|) |v_ULTIMATE.start_main_~#t616~0.offset_10| 3)) |v_#memory_int_15|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t616~0.base_10| 4) |v_#length_17|) (not (= |v_ULTIMATE.start_main_~#t616~0.base_10| 0)) (= |v_ULTIMATE.start_main_~#t616~0.offset_10| 0) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t616~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t616~0.base_10|) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t616~0.base_10| 1) |v_#valid_38|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t616~0.offset=|v_ULTIMATE.start_main_~#t616~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t616~0.base=|v_ULTIMATE.start_main_~#t616~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t616~0.offset, ULTIMATE.start_main_#t~nondet40, #valid, #memory_int, ULTIMATE.start_main_~#t616~0.base, #length] because there is no mapped edge [2019-12-26 21:57:02,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] P0ENTRY-->P0EXIT: Formula: (and (= v_~a~0_23 1) (= v_~x~0_36 1) (= |v_P0Thread1of1ForFork1_#in~arg.base_19| v_P0Thread1of1ForFork1_~arg.base_19) (= v_~__unbuffered_cnt~0_101 (+ v_~__unbuffered_cnt~0_102 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_19|) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_102, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|} OutVars{~a~0=v_~a~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_19|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_19|, ~x~0=v_~x~0_36, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:57:02,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-1823785237 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1823785237 256)))) (or (and (= |P3Thread1of1ForFork0_#t~ite32_Out-1823785237| ~y~0_In-1823785237) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff1~0_In-1823785237 |P3Thread1of1ForFork0_#t~ite32_Out-1823785237|) (not .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1823785237, ~y$w_buff1~0=~y$w_buff1~0_In-1823785237, ~y~0=~y~0_In-1823785237, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1823785237} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-1823785237, ~y$w_buff1~0=~y$w_buff1~0_In-1823785237, ~y~0=~y~0_In-1823785237, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-1823785237|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1823785237} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-26 21:57:02,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L823-4-->L824: Formula: (= v_~y~0_43 |v_P3Thread1of1ForFork0_#t~ite32_14|) InVars {P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_14|} OutVars{~y~0=v_~y~0_43, P3Thread1of1ForFork0_#t~ite33=|v_P3Thread1of1ForFork0_#t~ite33_15|, P3Thread1of1ForFork0_#t~ite32=|v_P3Thread1of1ForFork0_#t~ite32_13|} AuxVars[] AssignedVars[~y~0, P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-26 21:57:02,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In212310350 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In212310350 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out212310350|)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In212310350 |P3Thread1of1ForFork0_#t~ite34_Out212310350|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In212310350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In212310350} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In212310350, ~y$w_buff0_used~0=~y$w_buff0_used~0_In212310350, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out212310350|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-26 21:57:02,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1458240282 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1458240282 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1458240282| ~y$w_buff0_used~0_In-1458240282)) (and (not .cse1) (= |P2Thread1of1ForFork3_#t~ite28_Out-1458240282| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458240282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1458240282} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1458240282, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1458240282, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out-1458240282|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-26 21:57:02,843 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-473056808 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-473056808 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-473056808 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-473056808 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out-473056808| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite29_Out-473056808| ~y$w_buff1_used~0_In-473056808) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-473056808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-473056808, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-473056808, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-473056808} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-473056808, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-473056808, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-473056808, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out-473056808|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-473056808} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-26 21:57:02,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1075652419 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In1075652419 256) 0))) (or (and (= ~y$r_buff0_thd3~0_Out1075652419 ~y$r_buff0_thd3~0_In1075652419) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out1075652419 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1075652419, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1075652419} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out1075652419|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1075652419, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out1075652419} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 21:57:02,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In-397197175 256))) (.cse2 (= (mod ~y$r_buff0_thd3~0_In-397197175 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-397197175 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-397197175 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out-397197175| 0)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-397197175| ~y$r_buff1_thd3~0_In-397197175)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-397197175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-397197175, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-397197175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-397197175} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-397197175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-397197175, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-397197175, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-397197175|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-397197175} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-26 21:57:02,844 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L804-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_125) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_126 (+ v_~__unbuffered_cnt~0_127 1))) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_125, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_126, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 21:57:02,845 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In698661090 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd4~0_In698661090 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In698661090 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In698661090 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork0_#t~ite35_Out698661090| ~y$w_buff1_used~0_In698661090) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P3Thread1of1ForFork0_#t~ite35_Out698661090| 0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In698661090, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In698661090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In698661090, ~y$w_buff1_used~0=~y$w_buff1_used~0_In698661090} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In698661090, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In698661090, ~y$w_buff0_used~0=~y$w_buff0_used~0_In698661090, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out698661090|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In698661090} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-26 21:57:02,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In497078788 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In497078788 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In497078788 |P3Thread1of1ForFork0_#t~ite36_Out497078788|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out497078788|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In497078788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In497078788} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In497078788, ~y$w_buff0_used~0=~y$w_buff0_used~0_In497078788, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out497078788|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-26 21:57:02,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd4~0_In1798693962 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1798693962 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In1798693962 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In1798693962 256) 0))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out1798693962|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd4~0_In1798693962 |P3Thread1of1ForFork0_#t~ite37_Out1798693962|)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1798693962, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1798693962, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1798693962, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798693962} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1798693962, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1798693962, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1798693962, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out1798693962|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1798693962} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-26 21:57:02,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L827-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= |v_P3Thread1of1ForFork0_#t~ite37_48| v_~y$r_buff1_thd4~0_61) (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_61, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_47|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:57:02,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In533089617 256) 0))) (or (and (not .cse0) (= ~y$w_buff0~0_In533089617 |P1Thread1of1ForFork2_#t~ite9_Out533089617|) (= |P1Thread1of1ForFork2_#t~ite8_In533089617| |P1Thread1of1ForFork2_#t~ite8_Out533089617|)) (and (= |P1Thread1of1ForFork2_#t~ite9_Out533089617| |P1Thread1of1ForFork2_#t~ite8_Out533089617|) .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In533089617 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In533089617 256)) .cse1) (= (mod ~y$w_buff0_used~0_In533089617 256) 0) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In533089617 256))))) (= ~y$w_buff0~0_In533089617 |P1Thread1of1ForFork2_#t~ite8_Out533089617|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In533089617, ~y$w_buff0_used~0=~y$w_buff0_used~0_In533089617, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In533089617|, ~y$w_buff0~0=~y$w_buff0~0_In533089617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In533089617, ~weak$$choice2~0=~weak$$choice2~0_In533089617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In533089617} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In533089617, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out533089617|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In533089617, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out533089617|, ~y$w_buff0~0=~y$w_buff0~0_In533089617, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In533089617, ~weak$$choice2~0=~weak$$choice2~0_In533089617, ~y$w_buff1_used~0=~y$w_buff1_used~0_In533089617} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 21:57:02,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1192543321 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite14_In-1192543321| |P1Thread1of1ForFork2_#t~ite14_Out-1192543321|) (= ~y$w_buff0_used~0_In-1192543321 |P1Thread1of1ForFork2_#t~ite15_Out-1192543321|)) (and .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1192543321 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-1192543321 256) 0)) (= (mod ~y$w_buff0_used~0_In-1192543321 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-1192543321 256) 0)))) (= ~y$w_buff0_used~0_In-1192543321 |P1Thread1of1ForFork2_#t~ite14_Out-1192543321|) (= |P1Thread1of1ForFork2_#t~ite15_Out-1192543321| |P1Thread1of1ForFork2_#t~ite14_Out-1192543321|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1192543321, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1192543321, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1192543321, ~weak$$choice2~0=~weak$$choice2~0_In-1192543321, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-1192543321|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1192543321} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1192543321, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1192543321, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1192543321, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1192543321|, ~weak$$choice2~0=~weak$$choice2~0_In-1192543321, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-1192543321|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1192543321} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 21:57:02,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L768-->L769: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_15|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_10|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_7|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 21:57:02,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In371161405 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite23_In371161405| |P1Thread1of1ForFork2_#t~ite23_Out371161405|) (= ~y$r_buff1_thd2~0_In371161405 |P1Thread1of1ForFork2_#t~ite24_Out371161405|) (not .cse0)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In371161405 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In371161405 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In371161405 256)) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In371161405 256))))) .cse0 (= ~y$r_buff1_thd2~0_In371161405 |P1Thread1of1ForFork2_#t~ite23_Out371161405|) (= |P1Thread1of1ForFork2_#t~ite24_Out371161405| |P1Thread1of1ForFork2_#t~ite23_Out371161405|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In371161405, ~y$w_buff0_used~0=~y$w_buff0_used~0_In371161405, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In371161405, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In371161405|, ~weak$$choice2~0=~weak$$choice2~0_In371161405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In371161405} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In371161405, ~y$w_buff0_used~0=~y$w_buff0_used~0_In371161405, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In371161405, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out371161405|, ~weak$$choice2~0=~weak$$choice2~0_In371161405, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out371161405|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In371161405} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 21:57:02,852 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L771-->L779: Formula: (and (= 0 v_~y$flush_delayed~0_8) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= v_~y~0_19 v_~y$mem_tmp~0_4) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, ~y~0=v_~y~0_19, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_11|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:57:02,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L852-1-->L858: Formula: (and (= 4 v_~__unbuffered_cnt~0_15) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:57:02,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite43_Out-1305699190| |ULTIMATE.start_main_#t~ite42_Out-1305699190|)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1305699190 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1305699190 256) 0))) (or (and (not .cse0) .cse1 (= ~y$w_buff1~0_In-1305699190 |ULTIMATE.start_main_#t~ite42_Out-1305699190|) (not .cse2)) (and .cse1 (= ~y~0_In-1305699190 |ULTIMATE.start_main_#t~ite42_Out-1305699190|) (or .cse0 .cse2)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1305699190, ~y~0=~y~0_In-1305699190, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305699190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305699190} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1305699190, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1305699190|, ~y~0=~y~0_In-1305699190, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1305699190|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1305699190, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1305699190} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:57:02,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-926786190 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-926786190 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-926786190| ~y$w_buff0_used~0_In-926786190)) (and (= |ULTIMATE.start_main_#t~ite44_Out-926786190| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-926786190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-926786190} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-926786190, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-926786190, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-926786190|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:57:02,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In1568820306 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1568820306 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1568820306 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In1568820306 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out1568820306|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1568820306 |ULTIMATE.start_main_#t~ite45_Out1568820306|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1568820306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1568820306, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1568820306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568820306} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1568820306, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1568820306, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1568820306, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1568820306|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568820306} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:57:02,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1976144321 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1976144321 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1976144321|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In1976144321 |ULTIMATE.start_main_#t~ite46_Out1976144321|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1976144321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1976144321} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1976144321, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1976144321, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1976144321|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 21:57:02,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1930000752 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1930000752 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1930000752 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1930000752 256) 0))) (or (and (= ~y$r_buff1_thd0~0_In-1930000752 |ULTIMATE.start_main_#t~ite47_Out-1930000752|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite47_Out-1930000752|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1930000752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1930000752, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1930000752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1930000752} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1930000752, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1930000752, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1930000752|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1930000752, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1930000752} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:57:02,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L862-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 2 v_~__unbuffered_p1_EAX~0_26) (= 2 v_~__unbuffered_p3_EAX~0_24) (= v_~__unbuffered_p1_EBX~0_25 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= v_~y$r_buff1_thd0~0_153 |v_ULTIMATE.start_main_#t~ite47_41|) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~x~0_45 2) (= v_~main$tmp_guard1~0_19 0) (= v_~z~0_103 2)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_41|, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_25, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_26, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_24, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_40|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~z~0=v_~z~0_103, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~x~0=v_~x~0_45, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:57:03,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:57:03 BasicIcfg [2019-12-26 21:57:03,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:57:03,008 INFO L168 Benchmark]: Toolchain (without parser) took 133238.05 ms. Allocated memory was 147.8 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 103.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-26 21:57:03,009 INFO L168 Benchmark]: CDTParser took 1.42 ms. Allocated memory is still 147.8 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-26 21:57:03,010 INFO L168 Benchmark]: CACSL2BoogieTranslator took 768.63 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 102.7 MB in the beginning and 157.0 MB in the end (delta: -54.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:57:03,010 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:57:03,010 INFO L168 Benchmark]: Boogie Preprocessor took 38.25 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-26 21:57:03,011 INFO L168 Benchmark]: RCFGBuilder took 760.38 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 103.1 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:57:03,011 INFO L168 Benchmark]: TraceAbstraction took 131606.85 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-26 21:57:03,019 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.42 ms. Allocated memory is still 147.8 MB. Free memory was 123.0 MB in the beginning and 122.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 768.63 ms. Allocated memory was 147.8 MB in the beginning and 203.9 MB in the end (delta: 56.1 MB). Free memory was 102.7 MB in the beginning and 157.0 MB in the end (delta: -54.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 58.35 ms. Allocated memory is still 203.9 MB. Free memory was 157.0 MB in the beginning and 154.4 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.25 ms. Allocated memory is still 203.9 MB. Free memory was 154.4 MB in the beginning and 151.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 760.38 ms. Allocated memory is still 203.9 MB. Free memory was 151.9 MB in the beginning and 103.1 MB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 131606.85 ms. Allocated memory was 203.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.5s, 181 ProgramPointsBefore, 88 ProgramPointsAfterwards, 209 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 26 ChoiceCompositions, 7917 VarBasedMoverChecksPositive, 267 VarBasedMoverChecksNegative, 87 SemBasedMoverChecksPositive, 235 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 66461 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L846] FCALL, FORK 0 pthread_create(&t613, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] FCALL, FORK 0 pthread_create(&t614, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] FCALL, FORK 0 pthread_create(&t615, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1 = y$w_buff0 [L785] 3 y$w_buff0 = 1 [L786] 3 y$w_buff1_used = y$w_buff0_used [L787] 3 y$w_buff0_used = (_Bool)1 [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L852] FCALL, FORK 0 pthread_create(&t616, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 4 z = 2 [L817] 4 __unbuffered_p3_EAX = z [L820] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L823] 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 2 x = 2 [L756] 2 __unbuffered_p1_EAX = x [L759] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 2 y$flush_delayed = weak$$choice2 [L762] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L800] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L763] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L801] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L802] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L825] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L826] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L765] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L766] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L858] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L859] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L860] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L861] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 169 locations, 2 error locations. Result: UNSAFE, OverallTime: 131.2s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 48.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6683 SDtfs, 9904 SDslu, 27050 SDs, 0 SdLazy, 20024 SolverSat, 513 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 494 GetRequests, 49 SyntacticMatches, 16 SemanticMatches, 429 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2567 ImplicationChecksByTransitivity, 6.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160898occurred 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: 37.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 225197 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1362 NumberOfCodeBlocks, 1362 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1275 ConstructedInterpolants, 0 QuantifiedInterpolants, 298737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...