/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_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:51:43,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:51:43,589 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:51:43,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:51:43,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:51:43,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:51:43,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:51:43,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:51:43,610 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:51:43,611 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:51:43,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:51:43,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:51:43,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:51:43,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:51:43,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:51:43,616 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:51:43,617 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:51:43,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:51:43,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:51:43,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:51:43,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:51:43,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:51:43,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:51:43,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:51:43,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:51:43,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:51:43,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:51:43,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:51:43,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:51:43,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:51:43,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:51:43,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:51:43,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:51:43,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:51:43,635 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:51:43,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:51:43,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:51:43,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:51:43,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:51:43,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:51:43,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:51:43,638 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-18 12:51:43,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:51:43,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:51:43,661 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:51:43,661 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:51:43,662 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:51:43,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:51:43,662 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:51:43,662 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:51:43,662 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:51:43,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:51:43,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:51:43,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:51:43,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:51:43,665 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:51:43,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:51:43,665 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:51:43,666 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:51:43,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:51:43,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:51:43,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:51:43,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:51:43,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:51:43,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:51:43,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:51:43,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:51:43,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:51:43,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:51:43,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:51:43,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:51:43,668 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:51:43,918 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:51:43,937 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:51:43,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:51:43,942 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:51:43,942 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:51:43,943 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2019-12-18 12:51:44,017 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0d5b2b8/fd13bc141c0c41b98b493c79e39bb2b3/FLAG5448cb1e3 [2019-12-18 12:51:44,564 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:51:44,565 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_rmo.opt.i [2019-12-18 12:51:44,580 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0d5b2b8/fd13bc141c0c41b98b493c79e39bb2b3/FLAG5448cb1e3 [2019-12-18 12:51:44,882 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a0d5b2b8/fd13bc141c0c41b98b493c79e39bb2b3 [2019-12-18 12:51:44,890 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:51:44,892 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:51:44,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:51:44,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:51:44,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:51:44,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:51:44" (1/1) ... [2019-12-18 12:51:44,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd6b77a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:44, skipping insertion in model container [2019-12-18 12:51:44,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:51:44" (1/1) ... [2019-12-18 12:51:44,907 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:51:44,972 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:51:45,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:51:45,456 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:51:45,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:51:45,607 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:51:45,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45 WrapperNode [2019-12-18 12:51:45,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:51:45,608 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:51:45,608 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:51:45,608 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:51:45,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,639 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,685 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:51:45,685 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:51:45,685 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:51:45,686 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:51:45,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,701 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,720 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... [2019-12-18 12:51:45,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:51:45,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:51:45,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:51:45,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:51:45,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:51:45,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:51:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:51:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:51:45,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:51:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:51:45,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:51:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:51:45,809 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:51:45,809 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:51:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:51:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 12:51:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 12:51:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:51:45,810 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:51:45,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:51:45,813 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:51:46,574 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:51:46,574 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:51:46,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:51:46 BoogieIcfgContainer [2019-12-18 12:51:46,576 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:51:46,578 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:51:46,578 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:51:46,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:51:46,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:51:44" (1/3) ... [2019-12-18 12:51:46,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142293d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:51:46, skipping insertion in model container [2019-12-18 12:51:46,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:51:45" (2/3) ... [2019-12-18 12:51:46,583 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@142293d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:51:46, skipping insertion in model container [2019-12-18 12:51:46,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:51:46" (3/3) ... [2019-12-18 12:51:46,586 INFO L109 eAbstractionObserver]: Analyzing ICFG mix023_rmo.opt.i [2019-12-18 12:51:46,596 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:51:46,596 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:51:46,605 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:51:46,606 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:51:46,649 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,650 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,650 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,651 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,653 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,653 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,654 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,654 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,659 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,660 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,661 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,662 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,663 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,664 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,665 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,666 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,711 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,712 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,714 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,714 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,715 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,715 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,723 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,723 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,723 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,723 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,724 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,725 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,726 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,727 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,728 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,732 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,732 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,732 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,733 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,733 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,734 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,734 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,736 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,737 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,737 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,737 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,741 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,746 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,747 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,747 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,747 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,747 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:51:46,764 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 12:51:46,784 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:51:46,784 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:51:46,784 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:51:46,784 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:51:46,784 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:51:46,784 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:51:46,784 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:51:46,785 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:51:46,801 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 181 places, 209 transitions [2019-12-18 12:51:46,803 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 12:51:46,901 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 12:51:46,901 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:51:46,921 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. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 12:51:46,949 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 181 places, 209 transitions [2019-12-18 12:51:47,000 INFO L126 PetriNetUnfolder]: 41/205 cut-off events. [2019-12-18 12:51:47,000 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:51:47,008 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. 12/174 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-18 12:51:47,030 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-18 12:51:47,031 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:51:52,026 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-18 12:51:52,861 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-18 12:51:53,052 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-12-18 12:51:53,249 INFO L206 etLargeBlockEncoding]: Checked pairs total: 66461 [2019-12-18 12:51:53,250 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-18 12:51:53,254 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-18 12:52:26,394 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160898 states. [2019-12-18 12:52:26,396 INFO L276 IsEmpty]: Start isEmpty. Operand 160898 states. [2019-12-18 12:52:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 12:52:26,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:26,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:26,403 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-18 12:52:26,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:26,408 INFO L82 PathProgramCache]: Analyzing trace with hash 406431864, now seen corresponding path program 1 times [2019-12-18 12:52:26,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:26,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920947089] [2019-12-18 12:52:26,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:26,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-18 12:52:26,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920947089] [2019-12-18 12:52:26,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:26,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:52:26,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866168275] [2019-12-18 12:52:26,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:52:26,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:52:26,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:26,745 INFO L87 Difference]: Start difference. First operand 160898 states. Second operand 3 states. [2019-12-18 12:52:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:28,470 INFO L93 Difference]: Finished difference Result 158998 states and 767616 transitions. [2019-12-18 12:52:28,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:52:28,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 12:52:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:34,160 INFO L225 Difference]: With dead ends: 158998 [2019-12-18 12:52:34,160 INFO L226 Difference]: Without dead ends: 149254 [2019-12-18 12:52:34,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:39,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149254 states. [2019-12-18 12:52:44,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149254 to 149254. [2019-12-18 12:52:44,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149254 states. [2019-12-18 12:52:52,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149254 states to 149254 states and 719596 transitions. [2019-12-18 12:52:52,253 INFO L78 Accepts]: Start accepts. Automaton has 149254 states and 719596 transitions. Word has length 7 [2019-12-18 12:52:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:52:52,254 INFO L462 AbstractCegarLoop]: Abstraction has 149254 states and 719596 transitions. [2019-12-18 12:52:52,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:52:52,254 INFO L276 IsEmpty]: Start isEmpty. Operand 149254 states and 719596 transitions. [2019-12-18 12:52:52,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:52:52,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:52:52,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:52:52,272 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-18 12:52:52,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:52:52,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1843730986, now seen corresponding path program 1 times [2019-12-18 12:52:52,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:52:52,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763642118] [2019-12-18 12:52:52,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:52:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:52:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:52:52,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763642118] [2019-12-18 12:52:52,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:52:52,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:52:52,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451035984] [2019-12-18 12:52:52,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:52:52,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:52:52,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:52:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:52:52,378 INFO L87 Difference]: Start difference. First operand 149254 states and 719596 transitions. Second operand 3 states. [2019-12-18 12:52:53,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:52:53,145 INFO L93 Difference]: Finished difference Result 94546 states and 411602 transitions. [2019-12-18 12:52:53,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:52:53,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 12:52:53,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:52:53,421 INFO L225 Difference]: With dead ends: 94546 [2019-12-18 12:52:53,421 INFO L226 Difference]: Without dead ends: 94546 [2019-12-18 12:52:53,422 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-18 12:53:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94546 states. [2019-12-18 12:53:02,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94546 to 94546. [2019-12-18 12:53:02,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94546 states. [2019-12-18 12:53:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94546 states to 94546 states and 411602 transitions. [2019-12-18 12:53:02,902 INFO L78 Accepts]: Start accepts. Automaton has 94546 states and 411602 transitions. Word has length 15 [2019-12-18 12:53:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:02,902 INFO L462 AbstractCegarLoop]: Abstraction has 94546 states and 411602 transitions. [2019-12-18 12:53:02,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 94546 states and 411602 transitions. [2019-12-18 12:53:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 12:53:02,905 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:02,906 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:02,906 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-18 12:53:02,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:02,906 INFO L82 PathProgramCache]: Analyzing trace with hash -425966823, now seen corresponding path program 1 times [2019-12-18 12:53:02,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:02,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710132481] [2019-12-18 12:53:02,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:02,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:02,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710132481] [2019-12-18 12:53:02,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:02,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:02,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141916387] [2019-12-18 12:53:02,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:53:02,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:03,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:53:03,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:53:03,000 INFO L87 Difference]: Start difference. First operand 94546 states and 411602 transitions. Second operand 4 states. [2019-12-18 12:53:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:05,024 INFO L93 Difference]: Finished difference Result 144639 states and 604914 transitions. [2019-12-18 12:53:05,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:53:05,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 12:53:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:05,661 INFO L225 Difference]: With dead ends: 144639 [2019-12-18 12:53:05,661 INFO L226 Difference]: Without dead ends: 144527 [2019-12-18 12:53:05,661 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:09,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144527 states. [2019-12-18 12:53:18,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144527 to 133390. [2019-12-18 12:53:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133390 states. [2019-12-18 12:53:19,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133390 states to 133390 states and 563187 transitions. [2019-12-18 12:53:19,759 INFO L78 Accepts]: Start accepts. Automaton has 133390 states and 563187 transitions. Word has length 15 [2019-12-18 12:53:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:19,759 INFO L462 AbstractCegarLoop]: Abstraction has 133390 states and 563187 transitions. [2019-12-18 12:53:19,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:53:19,759 INFO L276 IsEmpty]: Start isEmpty. Operand 133390 states and 563187 transitions. [2019-12-18 12:53:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:53:19,763 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:19,763 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:19,763 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-18 12:53:19,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:19,764 INFO L82 PathProgramCache]: Analyzing trace with hash -35287386, now seen corresponding path program 1 times [2019-12-18 12:53:19,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:19,765 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048403613] [2019-12-18 12:53:19,765 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:19,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:19,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048403613] [2019-12-18 12:53:19,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:19,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:19,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345684589] [2019-12-18 12:53:19,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:53:19,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:19,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:53:19,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:53:19,836 INFO L87 Difference]: Start difference. First operand 133390 states and 563187 transitions. Second operand 4 states. [2019-12-18 12:53:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:20,008 INFO L93 Difference]: Finished difference Result 37161 states and 133398 transitions. [2019-12-18 12:53:20,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:53:20,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:53:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:20,106 INFO L225 Difference]: With dead ends: 37161 [2019-12-18 12:53:20,106 INFO L226 Difference]: Without dead ends: 37161 [2019-12-18 12:53:20,107 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-18 12:53:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37161 states. [2019-12-18 12:53:20,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37161 to 37161. [2019-12-18 12:53:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37161 states. [2019-12-18 12:53:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37161 states to 37161 states and 133398 transitions. [2019-12-18 12:53:20,819 INFO L78 Accepts]: Start accepts. Automaton has 37161 states and 133398 transitions. Word has length 16 [2019-12-18 12:53:20,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:20,819 INFO L462 AbstractCegarLoop]: Abstraction has 37161 states and 133398 transitions. [2019-12-18 12:53:20,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:53:20,819 INFO L276 IsEmpty]: Start isEmpty. Operand 37161 states and 133398 transitions. [2019-12-18 12:53:20,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:53:20,823 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:20,823 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:20,823 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-18 12:53:20,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:20,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1700714978, now seen corresponding path program 1 times [2019-12-18 12:53:20,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:20,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610203768] [2019-12-18 12:53:20,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:20,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:20,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610203768] [2019-12-18 12:53:20,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:20,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:20,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315406910] [2019-12-18 12:53:20,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:53:20,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:20,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:53:20,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:20,909 INFO L87 Difference]: Start difference. First operand 37161 states and 133398 transitions. Second operand 5 states. [2019-12-18 12:53:21,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:21,447 INFO L93 Difference]: Finished difference Result 54896 states and 192989 transitions. [2019-12-18 12:53:21,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 12:53:21,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 12:53:21,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:22,702 INFO L225 Difference]: With dead ends: 54896 [2019-12-18 12:53:22,702 INFO L226 Difference]: Without dead ends: 54878 [2019-12-18 12:53:22,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:53:22,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54878 states. [2019-12-18 12:53:23,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54878 to 43369. [2019-12-18 12:53:23,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43369 states. [2019-12-18 12:53:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43369 states to 43369 states and 154803 transitions. [2019-12-18 12:53:23,513 INFO L78 Accepts]: Start accepts. Automaton has 43369 states and 154803 transitions. Word has length 16 [2019-12-18 12:53:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:23,513 INFO L462 AbstractCegarLoop]: Abstraction has 43369 states and 154803 transitions. [2019-12-18 12:53:23,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:53:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 43369 states and 154803 transitions. [2019-12-18 12:53:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 12:53:23,531 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:23,531 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-18 12:53:23,531 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-18 12:53:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1135187325, now seen corresponding path program 1 times [2019-12-18 12:53:23,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:23,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585696585] [2019-12-18 12:53:23,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:23,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:23,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585696585] [2019-12-18 12:53:23,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:23,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:53:23,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987469439] [2019-12-18 12:53:23,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:53:23,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:23,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:53:23,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:53:23,642 INFO L87 Difference]: Start difference. First operand 43369 states and 154803 transitions. Second operand 6 states. [2019-12-18 12:53:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:24,674 INFO L93 Difference]: Finished difference Result 65283 states and 226759 transitions. [2019-12-18 12:53:24,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:53:24,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 12:53:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:27,718 INFO L225 Difference]: With dead ends: 65283 [2019-12-18 12:53:27,718 INFO L226 Difference]: Without dead ends: 65253 [2019-12-18 12:53:27,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:53:27,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65253 states. [2019-12-18 12:53:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65253 to 43597. [2019-12-18 12:53:28,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43597 states. [2019-12-18 12:53:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43597 states to 43597 states and 154758 transitions. [2019-12-18 12:53:28,634 INFO L78 Accepts]: Start accepts. Automaton has 43597 states and 154758 transitions. Word has length 24 [2019-12-18 12:53:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:28,634 INFO L462 AbstractCegarLoop]: Abstraction has 43597 states and 154758 transitions. [2019-12-18 12:53:28,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:53:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 43597 states and 154758 transitions. [2019-12-18 12:53:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 12:53:28,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:28,656 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-18 12:53:28,657 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-18 12:53:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:28,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1458605799, now seen corresponding path program 1 times [2019-12-18 12:53:28,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:28,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812160162] [2019-12-18 12:53:28,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:28,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:28,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812160162] [2019-12-18 12:53:28,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:28,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:53:28,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194402217] [2019-12-18 12:53:28,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:53:28,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:28,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:53:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:28,725 INFO L87 Difference]: Start difference. First operand 43597 states and 154758 transitions. Second operand 5 states. [2019-12-18 12:53:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:28,842 INFO L93 Difference]: Finished difference Result 23301 states and 83755 transitions. [2019-12-18 12:53:28,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:53:28,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 12:53:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:28,885 INFO L225 Difference]: With dead ends: 23301 [2019-12-18 12:53:28,885 INFO L226 Difference]: Without dead ends: 23301 [2019-12-18 12:53:28,885 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-18 12:53:28,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23301 states. [2019-12-18 12:53:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23301 to 22997. [2019-12-18 12:53:29,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22997 states. [2019-12-18 12:53:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22997 states to 22997 states and 82723 transitions. [2019-12-18 12:53:29,608 INFO L78 Accepts]: Start accepts. Automaton has 22997 states and 82723 transitions. Word has length 28 [2019-12-18 12:53:29,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:29,608 INFO L462 AbstractCegarLoop]: Abstraction has 22997 states and 82723 transitions. [2019-12-18 12:53:29,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:53:29,608 INFO L276 IsEmpty]: Start isEmpty. Operand 22997 states and 82723 transitions. [2019-12-18 12:53:29,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 12:53:29,650 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:29,651 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-18 12:53:29,651 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-18 12:53:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash 289915716, now seen corresponding path program 1 times [2019-12-18 12:53:29,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:29,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656689229] [2019-12-18 12:53:29,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:29,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:29,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656689229] [2019-12-18 12:53:29,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:29,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:29,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464995719] [2019-12-18 12:53:29,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:29,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:29,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:29,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:29,743 INFO L87 Difference]: Start difference. First operand 22997 states and 82723 transitions. Second operand 3 states. [2019-12-18 12:53:29,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:29,932 INFO L93 Difference]: Finished difference Result 34696 states and 119073 transitions. [2019-12-18 12:53:29,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:29,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-18 12:53:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:29,998 INFO L225 Difference]: With dead ends: 34696 [2019-12-18 12:53:29,999 INFO L226 Difference]: Without dead ends: 23444 [2019-12-18 12:53:30,000 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-18 12:53:30,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23444 states. [2019-12-18 12:53:30,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23444 to 23042. [2019-12-18 12:53:30,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23042 states. [2019-12-18 12:53:30,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23042 states to 23042 states and 72359 transitions. [2019-12-18 12:53:30,430 INFO L78 Accepts]: Start accepts. Automaton has 23042 states and 72359 transitions. Word has length 42 [2019-12-18 12:53:30,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:30,430 INFO L462 AbstractCegarLoop]: Abstraction has 23042 states and 72359 transitions. [2019-12-18 12:53:30,431 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:30,431 INFO L276 IsEmpty]: Start isEmpty. Operand 23042 states and 72359 transitions. [2019-12-18 12:53:30,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-18 12:53:30,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:30,470 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-18 12:53:30,470 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-18 12:53:30,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:30,471 INFO L82 PathProgramCache]: Analyzing trace with hash 9371836, now seen corresponding path program 1 times [2019-12-18 12:53:30,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:30,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018014021] [2019-12-18 12:53:30,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:30,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:30,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:30,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018014021] [2019-12-18 12:53:30,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:30,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:53:30,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629675159] [2019-12-18 12:53:30,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:53:30,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:30,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:53:30,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:53:30,587 INFO L87 Difference]: Start difference. First operand 23042 states and 72359 transitions. Second operand 6 states. [2019-12-18 12:53:30,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:30,694 INFO L93 Difference]: Finished difference Result 21758 states and 69087 transitions. [2019-12-18 12:53:30,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:53:30,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-18 12:53:30,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:30,712 INFO L225 Difference]: With dead ends: 21758 [2019-12-18 12:53:30,712 INFO L226 Difference]: Without dead ends: 11194 [2019-12-18 12:53:30,713 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-18 12:53:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11194 states. [2019-12-18 12:53:30,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11194 to 10798. [2019-12-18 12:53:30,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10798 states. [2019-12-18 12:53:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10798 states to 10798 states and 34133 transitions. [2019-12-18 12:53:30,889 INFO L78 Accepts]: Start accepts. Automaton has 10798 states and 34133 transitions. Word has length 43 [2019-12-18 12:53:30,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:30,889 INFO L462 AbstractCegarLoop]: Abstraction has 10798 states and 34133 transitions. [2019-12-18 12:53:30,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:53:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10798 states and 34133 transitions. [2019-12-18 12:53:30,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:53:30,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:30,907 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:30,907 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-18 12:53:30,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:30,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1454862528, now seen corresponding path program 1 times [2019-12-18 12:53:30,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:30,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974486380] [2019-12-18 12:53:30,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:30,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:30,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974486380] [2019-12-18 12:53:30,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:30,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:30,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37602628] [2019-12-18 12:53:30,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:30,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:30,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:30,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:30,967 INFO L87 Difference]: Start difference. First operand 10798 states and 34133 transitions. Second operand 3 states. [2019-12-18 12:53:31,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:31,065 INFO L93 Difference]: Finished difference Result 14554 states and 45133 transitions. [2019-12-18 12:53:31,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:31,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 12:53:31,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:31,092 INFO L225 Difference]: With dead ends: 14554 [2019-12-18 12:53:31,092 INFO L226 Difference]: Without dead ends: 14554 [2019-12-18 12:53:31,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:31,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14554 states. [2019-12-18 12:53:31,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14554 to 11851. [2019-12-18 12:53:31,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11851 states. [2019-12-18 12:53:31,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11851 states to 11851 states and 37349 transitions. [2019-12-18 12:53:31,390 INFO L78 Accepts]: Start accepts. Automaton has 11851 states and 37349 transitions. Word has length 57 [2019-12-18 12:53:31,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:31,390 INFO L462 AbstractCegarLoop]: Abstraction has 11851 states and 37349 transitions. [2019-12-18 12:53:31,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:31,390 INFO L276 IsEmpty]: Start isEmpty. Operand 11851 states and 37349 transitions. [2019-12-18 12:53:31,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:53:31,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:31,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:31,404 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-18 12:53:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash -880753033, now seen corresponding path program 1 times [2019-12-18 12:53:31,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:31,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792704436] [2019-12-18 12:53:31,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:31,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:31,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792704436] [2019-12-18 12:53:31,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:31,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:53:31,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55001223] [2019-12-18 12:53:31,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:53:31,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:31,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:53:31,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:53:31,479 INFO L87 Difference]: Start difference. First operand 11851 states and 37349 transitions. Second operand 4 states. [2019-12-18 12:53:31,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:31,572 INFO L93 Difference]: Finished difference Result 21477 states and 67702 transitions. [2019-12-18 12:53:31,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:53:31,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-18 12:53:31,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:31,595 INFO L225 Difference]: With dead ends: 21477 [2019-12-18 12:53:31,596 INFO L226 Difference]: Without dead ends: 9937 [2019-12-18 12:53:31,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:53:31,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9937 states. [2019-12-18 12:53:31,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9937 to 9937. [2019-12-18 12:53:31,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9937 states. [2019-12-18 12:53:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9937 states to 9937 states and 31212 transitions. [2019-12-18 12:53:31,860 INFO L78 Accepts]: Start accepts. Automaton has 9937 states and 31212 transitions. Word has length 57 [2019-12-18 12:53:31,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:31,860 INFO L462 AbstractCegarLoop]: Abstraction has 9937 states and 31212 transitions. [2019-12-18 12:53:31,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:53:31,860 INFO L276 IsEmpty]: Start isEmpty. Operand 9937 states and 31212 transitions. [2019-12-18 12:53:31,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:53:31,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:31,879 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:31,879 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-18 12:53:31,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:31,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1310347391, now seen corresponding path program 2 times [2019-12-18 12:53:31,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:31,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677331758] [2019-12-18 12:53:31,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:32,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677331758] [2019-12-18 12:53:32,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:32,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:53:32,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184561352] [2019-12-18 12:53:32,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:53:32,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:32,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:53:32,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:53:32,016 INFO L87 Difference]: Start difference. First operand 9937 states and 31212 transitions. Second operand 7 states. [2019-12-18 12:53:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:32,389 INFO L93 Difference]: Finished difference Result 26843 states and 84141 transitions. [2019-12-18 12:53:32,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:53:32,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 12:53:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:32,432 INFO L225 Difference]: With dead ends: 26843 [2019-12-18 12:53:32,432 INFO L226 Difference]: Without dead ends: 20587 [2019-12-18 12:53:32,432 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-18 12:53:32,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20587 states. [2019-12-18 12:53:32,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20587 to 12177. [2019-12-18 12:53:32,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12177 states. [2019-12-18 12:53:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 38516 transitions. [2019-12-18 12:53:32,724 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 38516 transitions. Word has length 57 [2019-12-18 12:53:32,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:32,724 INFO L462 AbstractCegarLoop]: Abstraction has 12177 states and 38516 transitions. [2019-12-18 12:53:32,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:53:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 38516 transitions. [2019-12-18 12:53:32,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:53:32,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:32,744 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:32,745 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-18 12:53:32,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:32,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1030628791, now seen corresponding path program 3 times [2019-12-18 12:53:32,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:32,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970473228] [2019-12-18 12:53:32,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:32,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:32,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970473228] [2019-12-18 12:53:32,856 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:32,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 12:53:32,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290835873] [2019-12-18 12:53:32,857 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 12:53:32,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:32,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 12:53:32,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:53:32,860 INFO L87 Difference]: Start difference. First operand 12177 states and 38516 transitions. Second operand 7 states. [2019-12-18 12:53:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:33,430 INFO L93 Difference]: Finished difference Result 33666 states and 104259 transitions. [2019-12-18 12:53:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 12:53:33,430 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-18 12:53:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:33,486 INFO L225 Difference]: With dead ends: 33666 [2019-12-18 12:53:33,486 INFO L226 Difference]: Without dead ends: 24086 [2019-12-18 12:53:33,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-18 12:53:33,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24086 states. [2019-12-18 12:53:34,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24086 to 15349. [2019-12-18 12:53:34,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15349 states. [2019-12-18 12:53:34,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15349 states to 15349 states and 48528 transitions. [2019-12-18 12:53:34,135 INFO L78 Accepts]: Start accepts. Automaton has 15349 states and 48528 transitions. Word has length 57 [2019-12-18 12:53:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:34,135 INFO L462 AbstractCegarLoop]: Abstraction has 15349 states and 48528 transitions. [2019-12-18 12:53:34,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 12:53:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 15349 states and 48528 transitions. [2019-12-18 12:53:34,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:53:34,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:34,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:34,159 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-18 12:53:34,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:34,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1587000503, now seen corresponding path program 4 times [2019-12-18 12:53:34,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:34,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285860592] [2019-12-18 12:53:34,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:34,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285860592] [2019-12-18 12:53:34,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:34,283 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:53:34,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626755401] [2019-12-18 12:53:34,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:53:34,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:34,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:53:34,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:53:34,285 INFO L87 Difference]: Start difference. First operand 15349 states and 48528 transitions. Second operand 8 states. [2019-12-18 12:53:35,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:35,262 INFO L93 Difference]: Finished difference Result 34932 states and 106981 transitions. [2019-12-18 12:53:35,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:53:35,263 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-12-18 12:53:35,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:35,313 INFO L225 Difference]: With dead ends: 34932 [2019-12-18 12:53:35,313 INFO L226 Difference]: Without dead ends: 32668 [2019-12-18 12:53:35,314 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-18 12:53:35,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32668 states. [2019-12-18 12:53:35,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32668 to 15407. [2019-12-18 12:53:35,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15407 states. [2019-12-18 12:53:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15407 states to 15407 states and 48800 transitions. [2019-12-18 12:53:35,692 INFO L78 Accepts]: Start accepts. Automaton has 15407 states and 48800 transitions. Word has length 57 [2019-12-18 12:53:35,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:35,693 INFO L462 AbstractCegarLoop]: Abstraction has 15407 states and 48800 transitions. [2019-12-18 12:53:35,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:53:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 15407 states and 48800 transitions. [2019-12-18 12:53:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:53:35,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:35,712 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:35,712 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-18 12:53:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash -979581959, now seen corresponding path program 5 times [2019-12-18 12:53:35,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:35,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689424663] [2019-12-18 12:53:35,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:35,835 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689424663] [2019-12-18 12:53:35,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:35,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:53:35,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987706413] [2019-12-18 12:53:35,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:53:35,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:35,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:53:35,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:53:35,837 INFO L87 Difference]: Start difference. First operand 15407 states and 48800 transitions. Second operand 9 states. [2019-12-18 12:53:37,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:37,290 INFO L93 Difference]: Finished difference Result 48430 states and 148036 transitions. [2019-12-18 12:53:37,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:53:37,290 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 12:53:37,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:37,362 INFO L225 Difference]: With dead ends: 48430 [2019-12-18 12:53:37,362 INFO L226 Difference]: Without dead ends: 46166 [2019-12-18 12:53:37,363 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-18 12:53:37,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46166 states. [2019-12-18 12:53:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46166 to 15428. [2019-12-18 12:53:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15428 states. [2019-12-18 12:53:38,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15428 states to 15428 states and 48880 transitions. [2019-12-18 12:53:38,036 INFO L78 Accepts]: Start accepts. Automaton has 15428 states and 48880 transitions. Word has length 57 [2019-12-18 12:53:38,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:38,037 INFO L462 AbstractCegarLoop]: Abstraction has 15428 states and 48880 transitions. [2019-12-18 12:53:38,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:53:38,037 INFO L276 IsEmpty]: Start isEmpty. Operand 15428 states and 48880 transitions. [2019-12-18 12:53:38,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:53:38,056 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:38,056 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:38,056 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-18 12:53:38,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:38,056 INFO L82 PathProgramCache]: Analyzing trace with hash -2032569873, now seen corresponding path program 6 times [2019-12-18 12:53:38,057 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:38,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136452084] [2019-12-18 12:53:38,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:38,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136452084] [2019-12-18 12:53:38,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:38,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:53:38,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127611893] [2019-12-18 12:53:38,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 12:53:38,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:38,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 12:53:38,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:53:38,174 INFO L87 Difference]: Start difference. First operand 15428 states and 48880 transitions. Second operand 9 states. [2019-12-18 12:53:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:39,700 INFO L93 Difference]: Finished difference Result 62597 states and 191406 transitions. [2019-12-18 12:53:39,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-18 12:53:39,701 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-18 12:53:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:39,784 INFO L225 Difference]: With dead ends: 62597 [2019-12-18 12:53:39,784 INFO L226 Difference]: Without dead ends: 54167 [2019-12-18 12:53:39,785 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-18 12:53:39,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54167 states. [2019-12-18 12:53:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54167 to 19382. [2019-12-18 12:53:40,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19382 states. [2019-12-18 12:53:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19382 states to 19382 states and 61433 transitions. [2019-12-18 12:53:40,384 INFO L78 Accepts]: Start accepts. Automaton has 19382 states and 61433 transitions. Word has length 57 [2019-12-18 12:53:40,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:40,384 INFO L462 AbstractCegarLoop]: Abstraction has 19382 states and 61433 transitions. [2019-12-18 12:53:40,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 12:53:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 19382 states and 61433 transitions. [2019-12-18 12:53:40,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-18 12:53:40,405 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:40,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:53:40,405 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-18 12:53:40,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:40,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1355321517, now seen corresponding path program 7 times [2019-12-18 12:53:40,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:40,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032213090] [2019-12-18 12:53:40,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:40,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032213090] [2019-12-18 12:53:40,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:40,514 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:40,514 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831458286] [2019-12-18 12:53:40,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:40,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:40,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:40,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:40,515 INFO L87 Difference]: Start difference. First operand 19382 states and 61433 transitions. Second operand 3 states. [2019-12-18 12:53:40,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:40,711 INFO L93 Difference]: Finished difference Result 16496 states and 51087 transitions. [2019-12-18 12:53:40,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:40,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-18 12:53:40,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:40,733 INFO L225 Difference]: With dead ends: 16496 [2019-12-18 12:53:40,733 INFO L226 Difference]: Without dead ends: 16496 [2019-12-18 12:53:40,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:40,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16496 states. [2019-12-18 12:53:40,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16496 to 15921. [2019-12-18 12:53:40,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15921 states. [2019-12-18 12:53:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15921 states to 15921 states and 49194 transitions. [2019-12-18 12:53:40,970 INFO L78 Accepts]: Start accepts. Automaton has 15921 states and 49194 transitions. Word has length 57 [2019-12-18 12:53:40,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:40,970 INFO L462 AbstractCegarLoop]: Abstraction has 15921 states and 49194 transitions. [2019-12-18 12:53:40,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 15921 states and 49194 transitions. [2019-12-18 12:53:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:53:40,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:40,987 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-18 12:53:40,987 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-18 12:53:40,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:40,988 INFO L82 PathProgramCache]: Analyzing trace with hash -454137528, now seen corresponding path program 1 times [2019-12-18 12:53:40,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:40,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711006403] [2019-12-18 12:53:40,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:41,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711006403] [2019-12-18 12:53:41,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:41,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:53:41,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149589396] [2019-12-18 12:53:41,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:41,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:41,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:41,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:41,218 INFO L87 Difference]: Start difference. First operand 15921 states and 49194 transitions. Second operand 11 states. [2019-12-18 12:53:43,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:43,992 INFO L93 Difference]: Finished difference Result 33289 states and 102035 transitions. [2019-12-18 12:53:43,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 12:53:43,993 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 12:53:43,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:44,027 INFO L225 Difference]: With dead ends: 33289 [2019-12-18 12:53:44,027 INFO L226 Difference]: Without dead ends: 23951 [2019-12-18 12:53:44,027 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-18 12:53:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23951 states. [2019-12-18 12:53:44,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23951 to 16786. [2019-12-18 12:53:44,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16786 states. [2019-12-18 12:53:44,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16786 states to 16786 states and 51436 transitions. [2019-12-18 12:53:44,334 INFO L78 Accepts]: Start accepts. Automaton has 16786 states and 51436 transitions. Word has length 58 [2019-12-18 12:53:44,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:44,335 INFO L462 AbstractCegarLoop]: Abstraction has 16786 states and 51436 transitions. [2019-12-18 12:53:44,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:44,335 INFO L276 IsEmpty]: Start isEmpty. Operand 16786 states and 51436 transitions. [2019-12-18 12:53:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:53:44,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:44,352 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-18 12:53:44,353 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-18 12:53:44,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:44,353 INFO L82 PathProgramCache]: Analyzing trace with hash 540759914, now seen corresponding path program 2 times [2019-12-18 12:53:44,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:44,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193506891] [2019-12-18 12:53:44,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:44,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:44,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:44,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193506891] [2019-12-18 12:53:44,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:44,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 12:53:44,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357074882] [2019-12-18 12:53:44,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:53:44,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:44,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:53:44,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:53:44,451 INFO L87 Difference]: Start difference. First operand 16786 states and 51436 transitions. Second operand 8 states. [2019-12-18 12:53:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:46,189 INFO L93 Difference]: Finished difference Result 29302 states and 86887 transitions. [2019-12-18 12:53:46,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:53:46,190 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-18 12:53:46,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:46,231 INFO L225 Difference]: With dead ends: 29302 [2019-12-18 12:53:46,231 INFO L226 Difference]: Without dead ends: 29080 [2019-12-18 12:53:46,231 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-18 12:53:46,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29080 states. [2019-12-18 12:53:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29080 to 20735. [2019-12-18 12:53:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20735 states. [2019-12-18 12:53:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20735 states to 20735 states and 63126 transitions. [2019-12-18 12:53:46,628 INFO L78 Accepts]: Start accepts. Automaton has 20735 states and 63126 transitions. Word has length 58 [2019-12-18 12:53:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:46,628 INFO L462 AbstractCegarLoop]: Abstraction has 20735 states and 63126 transitions. [2019-12-18 12:53:46,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:53:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 20735 states and 63126 transitions. [2019-12-18 12:53:46,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:53:46,649 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:46,649 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-18 12:53:46,650 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-18 12:53:46,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:46,650 INFO L82 PathProgramCache]: Analyzing trace with hash 755166698, now seen corresponding path program 3 times [2019-12-18 12:53:46,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:46,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969865939] [2019-12-18 12:53:46,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:46,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:46,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:46,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969865939] [2019-12-18 12:53:46,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:46,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:53:46,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515795646] [2019-12-18 12:53:46,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:46,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:46,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:46,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:46,842 INFO L87 Difference]: Start difference. First operand 20735 states and 63126 transitions. Second operand 11 states. [2019-12-18 12:53:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:48,649 INFO L93 Difference]: Finished difference Result 32233 states and 97204 transitions. [2019-12-18 12:53:48,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:53:48,649 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 12:53:48,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:48,690 INFO L225 Difference]: With dead ends: 32233 [2019-12-18 12:53:48,691 INFO L226 Difference]: Without dead ends: 27963 [2019-12-18 12:53:48,691 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-18 12:53:48,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27963 states. [2019-12-18 12:53:49,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27963 to 20789. [2019-12-18 12:53:49,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20789 states. [2019-12-18 12:53:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20789 states to 20789 states and 63080 transitions. [2019-12-18 12:53:49,071 INFO L78 Accepts]: Start accepts. Automaton has 20789 states and 63080 transitions. Word has length 58 [2019-12-18 12:53:49,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:49,071 INFO L462 AbstractCegarLoop]: Abstraction has 20789 states and 63080 transitions. [2019-12-18 12:53:49,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 20789 states and 63080 transitions. [2019-12-18 12:53:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:53:49,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:49,329 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-18 12:53:49,329 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-18 12:53:49,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:49,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1780291492, now seen corresponding path program 4 times [2019-12-18 12:53:49,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:49,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057653519] [2019-12-18 12:53:49,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:49,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:49,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057653519] [2019-12-18 12:53:49,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:49,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:53:49,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332330846] [2019-12-18 12:53:49,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:49,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:49,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:49,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:49,508 INFO L87 Difference]: Start difference. First operand 20789 states and 63080 transitions. Second operand 11 states. [2019-12-18 12:53:51,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:51,083 INFO L93 Difference]: Finished difference Result 29331 states and 88457 transitions. [2019-12-18 12:53:51,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:53:51,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 12:53:51,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:51,124 INFO L225 Difference]: With dead ends: 29331 [2019-12-18 12:53:51,124 INFO L226 Difference]: Without dead ends: 27843 [2019-12-18 12:53:51,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=414, Unknown=0, NotChecked=0, Total=506 [2019-12-18 12:53:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27843 states. [2019-12-18 12:53:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27843 to 20901. [2019-12-18 12:53:51,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20901 states. [2019-12-18 12:53:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20901 states to 20901 states and 63326 transitions. [2019-12-18 12:53:51,492 INFO L78 Accepts]: Start accepts. Automaton has 20901 states and 63326 transitions. Word has length 58 [2019-12-18 12:53:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:51,492 INFO L462 AbstractCegarLoop]: Abstraction has 20901 states and 63326 transitions. [2019-12-18 12:53:51,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:51,492 INFO L276 IsEmpty]: Start isEmpty. Operand 20901 states and 63326 transitions. [2019-12-18 12:53:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:53:51,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:51,515 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-18 12:53:51,515 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-18 12:53:51,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash 797101106, now seen corresponding path program 5 times [2019-12-18 12:53:51,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:51,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277429079] [2019-12-18 12:53:51,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:51,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277429079] [2019-12-18 12:53:51,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:51,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:53:51,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101181712] [2019-12-18 12:53:51,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:51,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:51,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:51,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:51,660 INFO L87 Difference]: Start difference. First operand 20901 states and 63326 transitions. Second operand 11 states. [2019-12-18 12:53:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:53,075 INFO L93 Difference]: Finished difference Result 28487 states and 85982 transitions. [2019-12-18 12:53:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 12:53:53,075 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-18 12:53:53,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:53,116 INFO L225 Difference]: With dead ends: 28487 [2019-12-18 12:53:53,116 INFO L226 Difference]: Without dead ends: 27866 [2019-12-18 12:53:53,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-18 12:53:53,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27866 states. [2019-12-18 12:53:53,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27866 to 20865. [2019-12-18 12:53:53,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20865 states. [2019-12-18 12:53:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20865 states to 20865 states and 63238 transitions. [2019-12-18 12:53:53,718 INFO L78 Accepts]: Start accepts. Automaton has 20865 states and 63238 transitions. Word has length 58 [2019-12-18 12:53:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:53,718 INFO L462 AbstractCegarLoop]: Abstraction has 20865 states and 63238 transitions. [2019-12-18 12:53:53,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 20865 states and 63238 transitions. [2019-12-18 12:53:53,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:53:53,740 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:53,740 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-18 12:53:53,741 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-18 12:53:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:53,741 INFO L82 PathProgramCache]: Analyzing trace with hash -199714182, now seen corresponding path program 6 times [2019-12-18 12:53:53,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:53,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763971478] [2019-12-18 12:53:53,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:53,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763971478] [2019-12-18 12:53:53,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:53,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:53:53,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83147110] [2019-12-18 12:53:53,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:53:53,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:53:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:53:53,889 INFO L87 Difference]: Start difference. First operand 20865 states and 63238 transitions. Second operand 12 states. [2019-12-18 12:53:55,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:55,782 INFO L93 Difference]: Finished difference Result 30585 states and 91967 transitions. [2019-12-18 12:53:55,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 12:53:55,783 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-12-18 12:53:55,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:55,828 INFO L225 Difference]: With dead ends: 30585 [2019-12-18 12:53:55,828 INFO L226 Difference]: Without dead ends: 29521 [2019-12-18 12:53:55,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=510, Unknown=0, NotChecked=0, Total=650 [2019-12-18 12:53:55,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29521 states. [2019-12-18 12:53:56,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29521 to 20677. [2019-12-18 12:53:56,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20677 states. [2019-12-18 12:53:56,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20677 states to 20677 states and 62762 transitions. [2019-12-18 12:53:56,232 INFO L78 Accepts]: Start accepts. Automaton has 20677 states and 62762 transitions. Word has length 58 [2019-12-18 12:53:56,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:56,233 INFO L462 AbstractCegarLoop]: Abstraction has 20677 states and 62762 transitions. [2019-12-18 12:53:56,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:53:56,233 INFO L276 IsEmpty]: Start isEmpty. Operand 20677 states and 62762 transitions. [2019-12-18 12:53:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-18 12:53:56,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:56,258 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-18 12:53:56,258 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-18 12:53:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2078538356, now seen corresponding path program 7 times [2019-12-18 12:53:56,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:56,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988998164] [2019-12-18 12:53:56,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:56,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988998164] [2019-12-18 12:53:56,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:56,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:53:56,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745660836] [2019-12-18 12:53:56,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:53:56,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:56,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:53:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:56,326 INFO L87 Difference]: Start difference. First operand 20677 states and 62762 transitions. Second operand 3 states. [2019-12-18 12:53:56,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:56,413 INFO L93 Difference]: Finished difference Result 20677 states and 62760 transitions. [2019-12-18 12:53:56,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:53:56,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-18 12:53:56,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:56,454 INFO L225 Difference]: With dead ends: 20677 [2019-12-18 12:53:56,454 INFO L226 Difference]: Without dead ends: 20677 [2019-12-18 12:53:56,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:53:56,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20677 states. [2019-12-18 12:53:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20677 to 17662. [2019-12-18 12:53:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17662 states. [2019-12-18 12:53:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17662 states to 17662 states and 54496 transitions. [2019-12-18 12:53:56,778 INFO L78 Accepts]: Start accepts. Automaton has 17662 states and 54496 transitions. Word has length 58 [2019-12-18 12:53:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:56,778 INFO L462 AbstractCegarLoop]: Abstraction has 17662 states and 54496 transitions. [2019-12-18 12:53:56,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:53:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 17662 states and 54496 transitions. [2019-12-18 12:53:56,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:56,805 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:56,805 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-18 12:53:56,806 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-18 12:53:56,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:56,806 INFO L82 PathProgramCache]: Analyzing trace with hash 235346217, now seen corresponding path program 1 times [2019-12-18 12:53:56,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:56,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130240658] [2019-12-18 12:53:56,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:57,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130240658] [2019-12-18 12:53:57,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:57,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:53:57,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371844030] [2019-12-18 12:53:57,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:53:57,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:57,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:53:57,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:53:57,070 INFO L87 Difference]: Start difference. First operand 17662 states and 54496 transitions. Second operand 11 states. [2019-12-18 12:53:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:53:58,168 INFO L93 Difference]: Finished difference Result 31928 states and 98523 transitions. [2019-12-18 12:53:58,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-18 12:53:58,168 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 12:53:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:53:58,214 INFO L225 Difference]: With dead ends: 31928 [2019-12-18 12:53:58,214 INFO L226 Difference]: Without dead ends: 31362 [2019-12-18 12:53:58,215 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-18 12:53:58,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31362 states. [2019-12-18 12:53:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31362 to 20496. [2019-12-18 12:53:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20496 states. [2019-12-18 12:53:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20496 states to 20496 states and 63318 transitions. [2019-12-18 12:53:58,616 INFO L78 Accepts]: Start accepts. Automaton has 20496 states and 63318 transitions. Word has length 59 [2019-12-18 12:53:58,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:53:58,616 INFO L462 AbstractCegarLoop]: Abstraction has 20496 states and 63318 transitions. [2019-12-18 12:53:58,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:53:58,616 INFO L276 IsEmpty]: Start isEmpty. Operand 20496 states and 63318 transitions. [2019-12-18 12:53:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:53:58,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:53:58,639 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-18 12:53:58,639 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-18 12:53:58,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:53:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash -1674144661, now seen corresponding path program 2 times [2019-12-18 12:53:58,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:53:58,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411128949] [2019-12-18 12:53:58,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:53:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:53:59,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:53:59,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411128949] [2019-12-18 12:53:59,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:53:59,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 12:53:59,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112457083] [2019-12-18 12:53:59,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 12:53:59,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:53:59,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 12:53:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-18 12:53:59,199 INFO L87 Difference]: Start difference. First operand 20496 states and 63318 transitions. Second operand 16 states. [2019-12-18 12:54:00,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:00,557 INFO L93 Difference]: Finished difference Result 23762 states and 72368 transitions. [2019-12-18 12:54:00,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 12:54:00,558 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-18 12:54:00,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:00,591 INFO L225 Difference]: With dead ends: 23762 [2019-12-18 12:54:00,591 INFO L226 Difference]: Without dead ends: 23220 [2019-12-18 12:54:00,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:54:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23220 states. [2019-12-18 12:54:00,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23220 to 21044. [2019-12-18 12:54:00,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21044 states. [2019-12-18 12:54:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21044 states to 21044 states and 64963 transitions. [2019-12-18 12:54:00,912 INFO L78 Accepts]: Start accepts. Automaton has 21044 states and 64963 transitions. Word has length 59 [2019-12-18 12:54:00,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:00,912 INFO L462 AbstractCegarLoop]: Abstraction has 21044 states and 64963 transitions. [2019-12-18 12:54:00,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 12:54:00,913 INFO L276 IsEmpty]: Start isEmpty. Operand 21044 states and 64963 transitions. [2019-12-18 12:54:00,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:54:00,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:00,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:54:00,938 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-18 12:54:00,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:00,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1422231217, now seen corresponding path program 1 times [2019-12-18 12:54:00,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:00,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508488540] [2019-12-18 12:54:00,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:00,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:54:00,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508488540] [2019-12-18 12:54:00,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:00,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:54:00,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360432254] [2019-12-18 12:54:00,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:54:00,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:00,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:54:00,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:54:00,980 INFO L87 Difference]: Start difference. First operand 21044 states and 64963 transitions. Second operand 3 states. [2019-12-18 12:54:01,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:01,125 INFO L93 Difference]: Finished difference Result 22188 states and 66487 transitions. [2019-12-18 12:54:01,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:54:01,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-18 12:54:01,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:01,177 INFO L225 Difference]: With dead ends: 22188 [2019-12-18 12:54:01,177 INFO L226 Difference]: Without dead ends: 22188 [2019-12-18 12:54:01,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:54:01,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22188 states. [2019-12-18 12:54:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22188 to 16307. [2019-12-18 12:54:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16307 states. [2019-12-18 12:54:01,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16307 states to 16307 states and 48969 transitions. [2019-12-18 12:54:01,813 INFO L78 Accepts]: Start accepts. Automaton has 16307 states and 48969 transitions. Word has length 59 [2019-12-18 12:54:01,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:01,813 INFO L462 AbstractCegarLoop]: Abstraction has 16307 states and 48969 transitions. [2019-12-18 12:54:01,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:54:01,813 INFO L276 IsEmpty]: Start isEmpty. Operand 16307 states and 48969 transitions. [2019-12-18 12:54:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:54:01,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:01,830 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-18 12:54:01,830 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-18 12:54:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:01,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1304528589, now seen corresponding path program 3 times [2019-12-18 12:54:01,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:01,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993385406] [2019-12-18 12:54:01,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:01,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:02,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-18 12:54:02,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993385406] [2019-12-18 12:54:02,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:02,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:54:02,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721635078] [2019-12-18 12:54:02,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:54:02,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:02,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:54:02,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:54:02,053 INFO L87 Difference]: Start difference. First operand 16307 states and 48969 transitions. Second operand 12 states. [2019-12-18 12:54:04,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:04,011 INFO L93 Difference]: Finished difference Result 24654 states and 72902 transitions. [2019-12-18 12:54:04,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:54:04,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-18 12:54:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:04,041 INFO L225 Difference]: With dead ends: 24654 [2019-12-18 12:54:04,042 INFO L226 Difference]: Without dead ends: 20756 [2019-12-18 12:54:04,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:54:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20756 states. [2019-12-18 12:54:04,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20756 to 14591. [2019-12-18 12:54:04,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14591 states. [2019-12-18 12:54:04,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14591 states to 14591 states and 43728 transitions. [2019-12-18 12:54:04,299 INFO L78 Accepts]: Start accepts. Automaton has 14591 states and 43728 transitions. Word has length 59 [2019-12-18 12:54:04,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:04,300 INFO L462 AbstractCegarLoop]: Abstraction has 14591 states and 43728 transitions. [2019-12-18 12:54:04,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:54:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 14591 states and 43728 transitions. [2019-12-18 12:54:04,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:54:04,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:04,315 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-18 12:54:04,315 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-18 12:54:04,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:04,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1167135079, now seen corresponding path program 4 times [2019-12-18 12:54:04,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:04,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627098355] [2019-12-18 12:54:04,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:54:04,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:54:04,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627098355] [2019-12-18 12:54:04,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:54:04,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 12:54:04,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251423000] [2019-12-18 12:54:04,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 12:54:04,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:54:04,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 12:54:04,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 12:54:04,606 INFO L87 Difference]: Start difference. First operand 14591 states and 43728 transitions. Second operand 11 states. [2019-12-18 12:54:05,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:54:05,584 INFO L93 Difference]: Finished difference Result 23144 states and 68955 transitions. [2019-12-18 12:54:05,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 12:54:05,585 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-12-18 12:54:05,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:54:05,615 INFO L225 Difference]: With dead ends: 23144 [2019-12-18 12:54:05,615 INFO L226 Difference]: Without dead ends: 19513 [2019-12-18 12:54:05,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 12:54:05,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19513 states. [2019-12-18 12:54:05,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19513 to 12371. [2019-12-18 12:54:05,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12371 states. [2019-12-18 12:54:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12371 states to 12371 states and 37374 transitions. [2019-12-18 12:54:05,847 INFO L78 Accepts]: Start accepts. Automaton has 12371 states and 37374 transitions. Word has length 59 [2019-12-18 12:54:05,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:54:05,848 INFO L462 AbstractCegarLoop]: Abstraction has 12371 states and 37374 transitions. [2019-12-18 12:54:05,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 12:54:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 12371 states and 37374 transitions. [2019-12-18 12:54:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-18 12:54:05,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:54:05,861 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-18 12:54:05,861 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:54:05,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:54:05,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1779176519, now seen corresponding path program 5 times [2019-12-18 12:54:05,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:54:05,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745969267] [2019-12-18 12:54:05,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:54:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:54:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:54:05,964 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:54:05,964 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:54:05,968 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) (= (select .cse0 |v_ULTIMATE.start_main_~#t621~0.base_29|) 0) (= v_~__unbuffered_cnt~0_187 0) (= 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_~y$r_buff1_thd3~0_189) (= 0 v_~__unbuffered_p3_EBX~0_48) (= v_~y$w_buff1~0_278 0) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t621~0.base_29| 4)) (= 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) (< |v_#StackHeapBarrier_22| |v_ULTIMATE.start_main_~#t621~0.base_29|) (= 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) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice0~0_22) (= v_~y$mem_tmp~0_24 0) (= 0 v_~y$r_buff0_thd3~0_225) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t621~0.base_29| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t621~0.base_29|) |v_ULTIMATE.start_main_~#t621~0.offset_21| 0)) |v_#memory_int_29|) (= 0 v_~__unbuffered_p1_EAX~0_47) (= (store .cse0 |v_ULTIMATE.start_main_~#t621~0.base_29| 1) |v_#valid_72|) (= 0 v_~__unbuffered_p3_EAX~0_48) (= |v_#NULL.offset_4| 0) (= 0 v_~y$r_buff0_thd4~0_120) (= 0 |v_ULTIMATE.start_main_~#t621~0.offset_21|) (= 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_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_82|, ULTIMATE.start_main_~#t622~0.offset=|v_ULTIMATE.start_main_~#t622~0.offset_21|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_75|, ULTIMATE.start_main_~#t622~0.base=|v_ULTIMATE.start_main_~#t622~0.base_29|, 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|, ULTIMATE.start_main_~#t623~0.base=|v_ULTIMATE.start_main_~#t623~0.base_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_~#t621~0.base=|v_ULTIMATE.start_main_~#t621~0.base_29|, 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|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_122, ULTIMATE.start_main_~#t621~0.offset=|v_ULTIMATE.start_main_~#t621~0.offset_21|, ~y$w_buff0~0=v_~y$w_buff0~0_386, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_225, ULTIMATE.start_main_~#t624~0.base=|v_ULTIMATE.start_main_~#t624~0.base_17|, ~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, ~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_~#t624~0.offset=|v_ULTIMATE.start_main_~#t624~0.offset_16|, 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|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t623~0.offset=|v_ULTIMATE.start_main_~#t623~0.offset_21|, ~z~0=v_~z~0_163, ~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_#t~ite47, ULTIMATE.start_main_~#t622~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t622~0.base, 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, ULTIMATE.start_main_~#t623~0.base, ~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_~#t621~0.base, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t621~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t624~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t624~0.offset, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t623~0.offset, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:54:05,969 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [816] [816] L846-1-->L848: Formula: (and (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t622~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t622~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t622~0.base_12| 0)) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t622~0.base_12| 4)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t622~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t622~0.base_12|) |v_ULTIMATE.start_main_~#t622~0.offset_10| 1)) |v_#memory_int_17|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t622~0.base_12|) 0) (= 0 |v_ULTIMATE.start_main_~#t622~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t622~0.offset=|v_ULTIMATE.start_main_~#t622~0.offset_10|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_19|, ULTIMATE.start_main_~#t622~0.base=|v_ULTIMATE.start_main_~#t622~0.base_12|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t622~0.offset, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t622~0.base] because there is no mapped edge [2019-12-18 12:54:05,970 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L848-1-->L850: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t623~0.base_13| 4) |v_#length_23|) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t623~0.base_13| 1)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t623~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t623~0.offset_11|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t623~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t623~0.base_13|) |v_ULTIMATE.start_main_~#t623~0.offset_11| 2)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t623~0.base_13|)) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t623~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t623~0.base=|v_ULTIMATE.start_main_~#t623~0.base_13|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t623~0.offset=|v_ULTIMATE.start_main_~#t623~0.offset_11|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t623~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t623~0.offset, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 12:54:05,971 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-18 12:54:05,972 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L850-1-->L852: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t624~0.base_10| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t624~0.base_10| 4)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t624~0.base_10|) (= 0 |v_ULTIMATE.start_main_~#t624~0.offset_10|) (not (= |v_ULTIMATE.start_main_~#t624~0.base_10| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t624~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t624~0.base_10|) |v_ULTIMATE.start_main_~#t624~0.offset_10| 3)) |v_#memory_int_15|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t624~0.base_10|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_4|, ULTIMATE.start_main_~#t624~0.offset=|v_ULTIMATE.start_main_~#t624~0.offset_10|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t624~0.base=|v_ULTIMATE.start_main_~#t624~0.base_10|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t624~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t624~0.base, #length] because there is no mapped edge [2019-12-18 12:54:05,974 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-18 12:54:06,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L823-2-->L823-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In894044366 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd4~0_In894044366 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork0_#t~ite32_Out894044366| ~y$w_buff1~0_In894044366) (not .cse1)) (and (= |P3Thread1of1ForFork0_#t~ite32_Out894044366| ~y~0_In894044366) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In894044366, ~y$w_buff1~0=~y$w_buff1~0_In894044366, ~y~0=~y~0_In894044366, ~y$w_buff1_used~0=~y$w_buff1_used~0_In894044366} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In894044366, ~y$w_buff1~0=~y$w_buff1~0_In894044366, ~y~0=~y~0_In894044366, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out894044366|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In894044366} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-18 12:54:06,060 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-18 12:54:06,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L824-->L824-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd4~0_In250606094 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In250606094 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In250606094 |P3Thread1of1ForFork0_#t~ite34_Out250606094|)) (and (not .cse1) (= 0 |P3Thread1of1ForFork0_#t~ite34_Out250606094|) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In250606094, ~y$w_buff0_used~0=~y$w_buff0_used~0_In250606094} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In250606094, ~y$w_buff0_used~0=~y$w_buff0_used~0_In250606094, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out250606094|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-18 12:54:06,060 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L801-->L801-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In328334790 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In328334790 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork3_#t~ite28_Out328334790| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In328334790 |P2Thread1of1ForFork3_#t~ite28_Out328334790|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In328334790, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In328334790} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In328334790, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In328334790, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out328334790|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-18 12:54:06,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In967153754 256))) (.cse1 (= (mod ~y$r_buff0_thd3~0_In967153754 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In967153754 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In967153754 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out967153754| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P2Thread1of1ForFork3_#t~ite29_Out967153754| ~y$w_buff1_used~0_In967153754)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In967153754, ~y$w_buff0_used~0=~y$w_buff0_used~0_In967153754, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In967153754, ~y$w_buff1_used~0=~y$w_buff1_used~0_In967153754} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In967153754, ~y$w_buff0_used~0=~y$w_buff0_used~0_In967153754, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In967153754, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out967153754|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In967153754} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-18 12:54:06,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L803-->L804: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In-5167984 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-5167984 256)))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd3~0_Out-5167984 0)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_Out-5167984 ~y$r_buff0_thd3~0_In-5167984)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-5167984, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-5167984} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-5167984|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-5167984, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-5167984} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 12:54:06,061 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L804-->L804-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-2097474306 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-2097474306 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-2097474306 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-2097474306 256)))) (or (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out-2097474306|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P2Thread1of1ForFork3_#t~ite31_Out-2097474306| ~y$r_buff1_thd3~0_In-2097474306)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2097474306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2097474306, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2097474306, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2097474306} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-2097474306, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2097474306, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2097474306, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-2097474306|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2097474306} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 12:54:06,062 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-18 12:54:06,062 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L825-->L825-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd4~0_In2091275404 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In2091275404 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In2091275404 256))) (.cse1 (= (mod ~y$r_buff0_thd4~0_In2091275404 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out2091275404|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2091275404 |P3Thread1of1ForFork0_#t~ite35_Out2091275404|) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2091275404, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In2091275404, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2091275404, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2091275404} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In2091275404, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In2091275404, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2091275404, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out2091275404|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2091275404} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-18 12:54:06,065 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L826-->L826-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-833661868 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-833661868 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd4~0_In-833661868 |P3Thread1of1ForFork0_#t~ite36_Out-833661868|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-833661868|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-833661868, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-833661868} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-833661868, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-833661868, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-833661868|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-18 12:54:06,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L827-->L827-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-814696969 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd4~0_In-814696969 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-814696969 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In-814696969 256)))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out-814696969|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork0_#t~ite37_Out-814696969| ~y$r_buff1_thd4~0_In-814696969) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-814696969, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-814696969, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-814696969, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-814696969} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-814696969, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-814696969, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-814696969, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out-814696969|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-814696969} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-18 12:54:06,066 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-18 12:54:06,066 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-325588894 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite8_In-325588894| |P1Thread1of1ForFork2_#t~ite8_Out-325588894|) (= ~y$w_buff0~0_In-325588894 |P1Thread1of1ForFork2_#t~ite9_Out-325588894|)) (and (= ~y$w_buff0~0_In-325588894 |P1Thread1of1ForFork2_#t~ite8_Out-325588894|) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-325588894 256)))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In-325588894 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-325588894 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-325588894 256))))) (= |P1Thread1of1ForFork2_#t~ite8_Out-325588894| |P1Thread1of1ForFork2_#t~ite9_Out-325588894|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-325588894, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-325588894, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-325588894|, ~y$w_buff0~0=~y$w_buff0~0_In-325588894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-325588894, ~weak$$choice2~0=~weak$$choice2~0_In-325588894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-325588894} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-325588894, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-325588894|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-325588894, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-325588894|, ~y$w_buff0~0=~y$w_buff0~0_In-325588894, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-325588894, ~weak$$choice2~0=~weak$$choice2~0_In-325588894, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-325588894} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 12:54:06,068 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L766-->L766-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-70236625 256) 0))) (or (and (= ~y$w_buff0_used~0_In-70236625 |P1Thread1of1ForFork2_#t~ite15_Out-70236625|) (= |P1Thread1of1ForFork2_#t~ite14_In-70236625| |P1Thread1of1ForFork2_#t~ite14_Out-70236625|) (not .cse0)) (and (= ~y$w_buff0_used~0_In-70236625 |P1Thread1of1ForFork2_#t~ite14_Out-70236625|) .cse0 (= |P1Thread1of1ForFork2_#t~ite15_Out-70236625| |P1Thread1of1ForFork2_#t~ite14_Out-70236625|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-70236625 256)))) (or (= (mod ~y$w_buff0_used~0_In-70236625 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In-70236625 256) 0)) (and (= (mod ~y$w_buff1_used~0_In-70236625 256) 0) .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-70236625, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-70236625, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-70236625, ~weak$$choice2~0=~weak$$choice2~0_In-70236625, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In-70236625|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-70236625} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-70236625, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-70236625, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-70236625, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-70236625|, ~weak$$choice2~0=~weak$$choice2~0_In-70236625, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out-70236625|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-70236625} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 12:54:06,070 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-18 12:54:06,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L769-->L769-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In120382467 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite24_Out120382467| ~y$r_buff1_thd2~0_In120382467) (= |P1Thread1of1ForFork2_#t~ite23_In120382467| |P1Thread1of1ForFork2_#t~ite23_Out120382467|)) (and .cse0 (= |P1Thread1of1ForFork2_#t~ite24_Out120382467| |P1Thread1of1ForFork2_#t~ite23_Out120382467|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In120382467 256) 0))) (or (and (= 0 (mod ~y$r_buff1_thd2~0_In120382467 256)) .cse1) (and (= (mod ~y$w_buff1_used~0_In120382467 256) 0) .cse1) (= 0 (mod ~y$w_buff0_used~0_In120382467 256)))) (= |P1Thread1of1ForFork2_#t~ite23_Out120382467| ~y$r_buff1_thd2~0_In120382467)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In120382467, ~y$w_buff0_used~0=~y$w_buff0_used~0_In120382467, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In120382467, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In120382467|, ~weak$$choice2~0=~weak$$choice2~0_In120382467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In120382467} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In120382467, ~y$w_buff0_used~0=~y$w_buff0_used~0_In120382467, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In120382467, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out120382467|, ~weak$$choice2~0=~weak$$choice2~0_In120382467, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out120382467|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In120382467} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 12:54:06,071 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-18 12:54:06,071 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-18 12:54:06,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L858-2-->L858-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In2121313687 256))) (.cse2 (= (mod ~y$r_buff1_thd0~0_In2121313687 256) 0)) (.cse0 (= |ULTIMATE.start_main_#t~ite42_Out2121313687| |ULTIMATE.start_main_#t~ite43_Out2121313687|))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out2121313687| ~y~0_In2121313687) .cse0 (or .cse1 .cse2)) (and (= |ULTIMATE.start_main_#t~ite42_Out2121313687| ~y$w_buff1~0_In2121313687) (not .cse1) (not .cse2) .cse0))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2121313687, ~y~0=~y~0_In2121313687, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2121313687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121313687} OutVars{~y$w_buff1~0=~y$w_buff1~0_In2121313687, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out2121313687|, ~y~0=~y~0_In2121313687, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out2121313687|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2121313687, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2121313687} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 12:54:06,073 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [797] [797] L859-->L859-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In29617515 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In29617515 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In29617515 |ULTIMATE.start_main_#t~ite44_Out29617515|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out29617515|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In29617515, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In29617515} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In29617515, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In29617515, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out29617515|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 12:54:06,074 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-539558405 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-539558405 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In-539558405 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In-539558405 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-539558405| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out-539558405| ~y$w_buff1_used~0_In-539558405)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-539558405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-539558405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-539558405, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-539558405} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-539558405, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-539558405, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-539558405, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-539558405|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-539558405} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 12:54:06,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L861-->L861-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-942248837 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-942248837 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out-942248837|) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd0~0_In-942248837 |ULTIMATE.start_main_#t~ite46_Out-942248837|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-942248837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-942248837} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-942248837, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-942248837, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-942248837|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 12:54:06,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L862-->L862-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1666354547 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1666354547 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1666354547 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In-1666354547 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite47_Out-1666354547|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite47_Out-1666354547| ~y$r_buff1_thd0~0_In-1666354547)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666354547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1666354547, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1666354547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1666354547} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1666354547, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1666354547, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1666354547|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1666354547, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1666354547} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 12:54:06,076 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-18 12:54:06,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:54:06 BasicIcfg [2019-12-18 12:54:06,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:54:06,157 INFO L168 Benchmark]: Toolchain (without parser) took 141265.14 ms. Allocated memory was 145.8 MB in the beginning and 3.2 GB in the end (delta: 3.1 GB). Free memory was 100.5 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 12:54:06,158 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 12:54:06,160 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.06 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 155.8 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:06,160 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.98 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:06,161 INFO L168 Benchmark]: Boogie Preprocessor took 43.62 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:06,161 INFO L168 Benchmark]: RCFGBuilder took 847.12 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 101.5 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2019-12-18 12:54:06,161 INFO L168 Benchmark]: TraceAbstraction took 139577.52 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.5 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 12:54:06,166 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.74 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 715.06 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 155.8 MB in the end (delta: -55.6 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.98 ms. Allocated memory is still 202.9 MB. Free memory was 155.8 MB in the beginning and 153.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.62 ms. Allocated memory is still 202.9 MB. Free memory was 153.1 MB in the beginning and 151.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 847.12 ms. Allocated memory is still 202.9 MB. Free memory was 150.5 MB in the beginning and 101.5 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139577.52 ms. Allocated memory was 202.9 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 101.5 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 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(&t621, ((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(&t622, ((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(&t623, ((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(&t624, ((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: 139.1s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 40.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6787 SDtfs, 9778 SDslu, 27446 SDs, 0 SdLazy, 17822 SolverSat, 502 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 459 GetRequests, 51 SyntacticMatches, 14 SemanticMatches, 394 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1850 ImplicationChecksByTransitivity, 5.3s 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: 53.4s AutomataMinimizationTime, 29 MinimizatonAttempts, 229329 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 1422 NumberOfCodeBlocks, 1422 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1334 ConstructedInterpolants, 0 QuantifiedInterpolants, 292104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...