/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/safe021_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:52:31,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:52:31,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:52:31,462 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:52:31,462 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:52:31,464 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:52:31,466 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:52:31,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:52:31,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:52:31,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:52:31,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:52:31,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:52:31,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:52:31,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:52:31,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:52:31,493 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:52:31,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:52:31,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:52:31,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:52:31,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:52:31,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:52:31,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:52:31,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:52:31,514 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:52:31,515 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:52:31,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:52:31,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:52:31,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:52:31,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:52:31,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:52:31,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:52:31,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:52:31,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:52:31,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:52:31,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:52:31,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:52:31,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:52:31,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:52:31,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:52:31,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:52:31,529 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:52:31,530 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 14:52:31,552 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:52:31,553 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:52:31,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:52:31,555 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:52:31,555 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:52:31,555 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:52:31,555 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:52:31,556 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:52:31,556 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:52:31,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:52:31,557 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:52:31,557 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:52:31,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:52:31,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:52:31,558 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:52:31,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:52:31,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:52:31,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:52:31,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:52:31,559 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:52:31,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:52:31,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:52:31,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:52:31,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:52:31,560 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:52:31,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:52:31,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:52:31,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:52:31,561 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:52:31,561 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:52:31,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:52:31,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:52:31,853 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:52:31,855 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:52:31,855 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:52:31,856 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-18 14:52:31,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c1e536d/eb71adb2b2fc4b2b8090b8f8717a61b9/FLAG501e6e95c [2019-12-18 14:52:32,492 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:52:32,493 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe021_power.oepc.i [2019-12-18 14:52:32,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c1e536d/eb71adb2b2fc4b2b8090b8f8717a61b9/FLAG501e6e95c [2019-12-18 14:52:32,757 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94c1e536d/eb71adb2b2fc4b2b8090b8f8717a61b9 [2019-12-18 14:52:32,769 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:52:32,771 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:52:32,772 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:52:32,772 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:52:32,775 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:52:32,776 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:52:32" (1/1) ... [2019-12-18 14:52:32,778 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75cc43a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:32, skipping insertion in model container [2019-12-18 14:52:32,778 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:52:32" (1/1) ... [2019-12-18 14:52:32,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:52:32,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:52:33,423 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:52:33,435 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:52:33,511 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:52:33,597 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:52:33,598 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33 WrapperNode [2019-12-18 14:52:33,598 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:52:33,599 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:52:33,599 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:52:33,599 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:52:33,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,628 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,658 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:52:33,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:52:33,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:52:33,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:52:33,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,673 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,673 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (1/1) ... [2019-12-18 14:52:33,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:52:33,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:52:33,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:52:33,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:52:33,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (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 14:52:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:52:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:52:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:52:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:52:33,779 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:52:33,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:52:33,780 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:52:33,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:52:33,780 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:52:33,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:52:33,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:52:33,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:52:33,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:52:33,783 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 14:52:34,615 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:52:34,616 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:52:34,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:52:34 BoogieIcfgContainer [2019-12-18 14:52:34,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:52:34,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:52:34,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:52:34,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:52:34,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:52:32" (1/3) ... [2019-12-18 14:52:34,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1118bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:52:34, skipping insertion in model container [2019-12-18 14:52:34,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:52:33" (2/3) ... [2019-12-18 14:52:34,629 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f1118bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:52:34, skipping insertion in model container [2019-12-18 14:52:34,630 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:52:34" (3/3) ... [2019-12-18 14:52:34,632 INFO L109 eAbstractionObserver]: Analyzing ICFG safe021_power.oepc.i [2019-12-18 14:52:34,644 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:52:34,644 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:52:34,659 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:52:34,660 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:52:34,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,720 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,720 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,721 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,721 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,722 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,727 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,728 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,729 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,730 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,730 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,755 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,756 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,756 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,757 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,758 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,759 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,760 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,761 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,762 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,763 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,764 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,769 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,770 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,771 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,772 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,773 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,774 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,775 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,776 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,777 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,778 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,779 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,784 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,785 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,785 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,787 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,788 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,791 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,792 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,792 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,794 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:52:34,814 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:52:34,838 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:52:34,838 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:52:34,838 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:52:34,838 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:52:34,839 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:52:34,839 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:52:34,839 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:52:34,839 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:52:34,861 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 175 places, 212 transitions [2019-12-18 14:52:34,863 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:52:34,965 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:52:34,966 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:52:34,992 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:52:35,019 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 175 places, 212 transitions [2019-12-18 14:52:35,123 INFO L126 PetriNetUnfolder]: 47/209 cut-off events. [2019-12-18 14:52:35,123 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:52:35,133 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 209 events. 47/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 437 event pairs. 9/169 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:52:35,154 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-18 14:52:35,156 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:52:40,849 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 14:52:40,961 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 14:52:41,302 INFO L206 etLargeBlockEncoding]: Checked pairs total: 125946 [2019-12-18 14:52:41,302 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-18 14:52:41,306 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 102 transitions [2019-12-18 14:52:59,396 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 111572 states. [2019-12-18 14:52:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand 111572 states. [2019-12-18 14:52:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:52:59,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:52:59,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:52:59,405 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:52:59,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:52:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash 912834, now seen corresponding path program 1 times [2019-12-18 14:52:59,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:52:59,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114592832] [2019-12-18 14:52:59,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:52:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:52:59,654 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 14:52:59,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114592832] [2019-12-18 14:52:59,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:52:59,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:52:59,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167262983] [2019-12-18 14:52:59,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:52:59,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:52:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:52:59,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:52:59,674 INFO L87 Difference]: Start difference. First operand 111572 states. Second operand 3 states. [2019-12-18 14:53:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:03,401 INFO L93 Difference]: Finished difference Result 110910 states and 474711 transitions. [2019-12-18 14:53:03,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:53:03,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:53:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:04,093 INFO L225 Difference]: With dead ends: 110910 [2019-12-18 14:53:04,093 INFO L226 Difference]: Without dead ends: 98066 [2019-12-18 14:53:04,096 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 14:53:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98066 states. [2019-12-18 14:53:12,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98066 to 98066. [2019-12-18 14:53:12,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98066 states. [2019-12-18 14:53:12,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98066 states to 98066 states and 418629 transitions. [2019-12-18 14:53:12,917 INFO L78 Accepts]: Start accepts. Automaton has 98066 states and 418629 transitions. Word has length 3 [2019-12-18 14:53:12,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:12,918 INFO L462 AbstractCegarLoop]: Abstraction has 98066 states and 418629 transitions. [2019-12-18 14:53:12,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:53:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 98066 states and 418629 transitions. [2019-12-18 14:53:12,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:53:12,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:12,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:12,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:12,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:12,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1027484309, now seen corresponding path program 1 times [2019-12-18 14:53:12,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:12,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385729632] [2019-12-18 14:53:12,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:12,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:13,042 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 14:53:13,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385729632] [2019-12-18 14:53:13,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:13,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:53:13,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993181188] [2019-12-18 14:53:13,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:53:13,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:53:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:53:13,047 INFO L87 Difference]: Start difference. First operand 98066 states and 418629 transitions. Second operand 4 states. [2019-12-18 14:53:18,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:18,278 INFO L93 Difference]: Finished difference Result 156656 states and 639635 transitions. [2019-12-18 14:53:18,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:53:18,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:53:18,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:18,826 INFO L225 Difference]: With dead ends: 156656 [2019-12-18 14:53:18,826 INFO L226 Difference]: Without dead ends: 156558 [2019-12-18 14:53:18,827 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 14:53:23,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156558 states. [2019-12-18 14:53:27,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156558 to 142946. [2019-12-18 14:53:27,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142946 states. [2019-12-18 14:53:27,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142946 states to 142946 states and 591329 transitions. [2019-12-18 14:53:27,447 INFO L78 Accepts]: Start accepts. Automaton has 142946 states and 591329 transitions. Word has length 11 [2019-12-18 14:53:27,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:27,447 INFO L462 AbstractCegarLoop]: Abstraction has 142946 states and 591329 transitions. [2019-12-18 14:53:27,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:53:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 142946 states and 591329 transitions. [2019-12-18 14:53:27,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:53:27,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:27,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:27,454 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:27,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:27,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1461043352, now seen corresponding path program 1 times [2019-12-18 14:53:27,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:27,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449325385] [2019-12-18 14:53:27,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:27,520 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 14:53:27,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449325385] [2019-12-18 14:53:27,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:27,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:53:27,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19853555] [2019-12-18 14:53:27,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:53:27,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:27,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:53:27,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:53:27,523 INFO L87 Difference]: Start difference. First operand 142946 states and 591329 transitions. Second operand 3 states. [2019-12-18 14:53:27,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:27,638 INFO L93 Difference]: Finished difference Result 31386 states and 102018 transitions. [2019-12-18 14:53:27,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:53:27,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:53:27,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:27,698 INFO L225 Difference]: With dead ends: 31386 [2019-12-18 14:53:27,698 INFO L226 Difference]: Without dead ends: 31386 [2019-12-18 14:53:27,699 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 14:53:27,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31386 states. [2019-12-18 14:53:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31386 to 31386. [2019-12-18 14:53:32,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31386 states. [2019-12-18 14:53:32,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31386 states to 31386 states and 102018 transitions. [2019-12-18 14:53:32,985 INFO L78 Accepts]: Start accepts. Automaton has 31386 states and 102018 transitions. Word has length 13 [2019-12-18 14:53:32,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:32,986 INFO L462 AbstractCegarLoop]: Abstraction has 31386 states and 102018 transitions. [2019-12-18 14:53:32,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:53:32,986 INFO L276 IsEmpty]: Start isEmpty. Operand 31386 states and 102018 transitions. [2019-12-18 14:53:32,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:53:32,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:32,990 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:32,990 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:32,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:32,990 INFO L82 PathProgramCache]: Analyzing trace with hash -876468662, now seen corresponding path program 1 times [2019-12-18 14:53:32,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:32,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281332394] [2019-12-18 14:53:32,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:33,086 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 14:53:33,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281332394] [2019-12-18 14:53:33,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:33,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:53:33,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462462333] [2019-12-18 14:53:33,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:53:33,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:33,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:53:33,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:53:33,088 INFO L87 Difference]: Start difference. First operand 31386 states and 102018 transitions. Second operand 5 states. [2019-12-18 14:53:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:33,601 INFO L93 Difference]: Finished difference Result 43205 states and 138515 transitions. [2019-12-18 14:53:33,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:53:33,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-18 14:53:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:33,705 INFO L225 Difference]: With dead ends: 43205 [2019-12-18 14:53:33,706 INFO L226 Difference]: Without dead ends: 43205 [2019-12-18 14:53:33,706 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 14:53:34,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43205 states. [2019-12-18 14:53:34,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43205 to 36470. [2019-12-18 14:53:34,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36470 states. [2019-12-18 14:53:34,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36470 states to 36470 states and 117941 transitions. [2019-12-18 14:53:34,592 INFO L78 Accepts]: Start accepts. Automaton has 36470 states and 117941 transitions. Word has length 16 [2019-12-18 14:53:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:34,593 INFO L462 AbstractCegarLoop]: Abstraction has 36470 states and 117941 transitions. [2019-12-18 14:53:34,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:53:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 36470 states and 117941 transitions. [2019-12-18 14:53:34,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 14:53:34,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:34,604 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] [2019-12-18 14:53:34,604 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:34,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:34,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1783143627, now seen corresponding path program 1 times [2019-12-18 14:53:34,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:34,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865990502] [2019-12-18 14:53:34,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:34,721 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 14:53:34,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865990502] [2019-12-18 14:53:34,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:34,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:53:34,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026242669] [2019-12-18 14:53:34,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:53:34,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:34,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:53:34,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:53:34,723 INFO L87 Difference]: Start difference. First operand 36470 states and 117941 transitions. Second operand 6 states. [2019-12-18 14:53:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:35,617 INFO L93 Difference]: Finished difference Result 56051 states and 176371 transitions. [2019-12-18 14:53:35,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:53:35,618 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-18 14:53:35,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:35,713 INFO L225 Difference]: With dead ends: 56051 [2019-12-18 14:53:35,713 INFO L226 Difference]: Without dead ends: 56037 [2019-12-18 14:53:35,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:53:36,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56037 states. [2019-12-18 14:53:36,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56037 to 37420. [2019-12-18 14:53:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37420 states. [2019-12-18 14:53:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37420 states to 37420 states and 120221 transitions. [2019-12-18 14:53:36,987 INFO L78 Accepts]: Start accepts. Automaton has 37420 states and 120221 transitions. Word has length 22 [2019-12-18 14:53:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:36,987 INFO L462 AbstractCegarLoop]: Abstraction has 37420 states and 120221 transitions. [2019-12-18 14:53:36,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:53:36,987 INFO L276 IsEmpty]: Start isEmpty. Operand 37420 states and 120221 transitions. [2019-12-18 14:53:37,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:53:37,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:37,002 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] [2019-12-18 14:53:37,002 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:37,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:37,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1148876988, now seen corresponding path program 1 times [2019-12-18 14:53:37,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:37,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532175644] [2019-12-18 14:53:37,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:37,064 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 14:53:37,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532175644] [2019-12-18 14:53:37,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:37,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:53:37,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701143875] [2019-12-18 14:53:37,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:53:37,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:53:37,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:53:37,067 INFO L87 Difference]: Start difference. First operand 37420 states and 120221 transitions. Second operand 4 states. [2019-12-18 14:53:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:37,143 INFO L93 Difference]: Finished difference Result 15281 states and 46378 transitions. [2019-12-18 14:53:37,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:53:37,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:53:37,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:37,164 INFO L225 Difference]: With dead ends: 15281 [2019-12-18 14:53:37,165 INFO L226 Difference]: Without dead ends: 15281 [2019-12-18 14:53:37,165 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 14:53:37,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15281 states. [2019-12-18 14:53:37,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15281 to 15023. [2019-12-18 14:53:37,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15023 states. [2019-12-18 14:53:37,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15023 states to 15023 states and 45642 transitions. [2019-12-18 14:53:37,390 INFO L78 Accepts]: Start accepts. Automaton has 15023 states and 45642 transitions. Word has length 25 [2019-12-18 14:53:37,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:37,391 INFO L462 AbstractCegarLoop]: Abstraction has 15023 states and 45642 transitions. [2019-12-18 14:53:37,391 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:53:37,391 INFO L276 IsEmpty]: Start isEmpty. Operand 15023 states and 45642 transitions. [2019-12-18 14:53:37,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:53:37,401 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:37,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:37,402 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:37,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1026533913, now seen corresponding path program 1 times [2019-12-18 14:53:37,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:37,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853226181] [2019-12-18 14:53:37,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:37,481 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 14:53:37,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853226181] [2019-12-18 14:53:37,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:37,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:53:37,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794153156] [2019-12-18 14:53:37,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:53:37,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:37,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:53:37,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:53:37,483 INFO L87 Difference]: Start difference. First operand 15023 states and 45642 transitions. Second operand 6 states. [2019-12-18 14:53:37,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:37,997 INFO L93 Difference]: Finished difference Result 21679 states and 63968 transitions. [2019-12-18 14:53:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:53:37,998 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-18 14:53:37,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:38,027 INFO L225 Difference]: With dead ends: 21679 [2019-12-18 14:53:38,027 INFO L226 Difference]: Without dead ends: 21679 [2019-12-18 14:53:38,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:53:38,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-18 14:53:38,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 17339. [2019-12-18 14:53:38,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17339 states. [2019-12-18 14:53:38,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17339 states to 17339 states and 52223 transitions. [2019-12-18 14:53:38,312 INFO L78 Accepts]: Start accepts. Automaton has 17339 states and 52223 transitions. Word has length 27 [2019-12-18 14:53:38,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:38,313 INFO L462 AbstractCegarLoop]: Abstraction has 17339 states and 52223 transitions. [2019-12-18 14:53:38,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:53:38,313 INFO L276 IsEmpty]: Start isEmpty. Operand 17339 states and 52223 transitions. [2019-12-18 14:53:38,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:53:38,330 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:38,330 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:38,330 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:38,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:38,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1079552274, now seen corresponding path program 1 times [2019-12-18 14:53:38,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:38,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887756692] [2019-12-18 14:53:38,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:38,470 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 14:53:38,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887756692] [2019-12-18 14:53:38,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:38,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:53:38,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901611022] [2019-12-18 14:53:38,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:53:38,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:38,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:53:38,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:53:38,472 INFO L87 Difference]: Start difference. First operand 17339 states and 52223 transitions. Second operand 8 states. [2019-12-18 14:53:39,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:39,861 INFO L93 Difference]: Finished difference Result 24561 states and 72020 transitions. [2019-12-18 14:53:39,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:53:39,863 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-18 14:53:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:39,893 INFO L225 Difference]: With dead ends: 24561 [2019-12-18 14:53:39,894 INFO L226 Difference]: Without dead ends: 24561 [2019-12-18 14:53:39,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-12-18 14:53:39,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24561 states. [2019-12-18 14:53:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24561 to 17437. [2019-12-18 14:53:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17437 states. [2019-12-18 14:53:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17437 states to 17437 states and 52503 transitions. [2019-12-18 14:53:40,193 INFO L78 Accepts]: Start accepts. Automaton has 17437 states and 52503 transitions. Word has length 33 [2019-12-18 14:53:40,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:40,193 INFO L462 AbstractCegarLoop]: Abstraction has 17437 states and 52503 transitions. [2019-12-18 14:53:40,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:53:40,193 INFO L276 IsEmpty]: Start isEmpty. Operand 17437 states and 52503 transitions. [2019-12-18 14:53:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 14:53:40,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:40,211 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:40,211 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:40,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:40,212 INFO L82 PathProgramCache]: Analyzing trace with hash -147828206, now seen corresponding path program 2 times [2019-12-18 14:53:40,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:40,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595267267] [2019-12-18 14:53:40,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:40,309 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 14:53:40,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595267267] [2019-12-18 14:53:40,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:40,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:53:40,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211049090] [2019-12-18 14:53:40,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:53:40,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:40,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:53:40,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:53:40,311 INFO L87 Difference]: Start difference. First operand 17437 states and 52503 transitions. Second operand 7 states. [2019-12-18 14:53:41,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:41,415 INFO L93 Difference]: Finished difference Result 24299 states and 71228 transitions. [2019-12-18 14:53:41,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 14:53:41,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-18 14:53:41,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:41,449 INFO L225 Difference]: With dead ends: 24299 [2019-12-18 14:53:41,449 INFO L226 Difference]: Without dead ends: 24299 [2019-12-18 14:53:41,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-18 14:53:41,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24299 states. [2019-12-18 14:53:41,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24299 to 16666. [2019-12-18 14:53:41,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16666 states. [2019-12-18 14:53:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16666 states to 16666 states and 50150 transitions. [2019-12-18 14:53:41,755 INFO L78 Accepts]: Start accepts. Automaton has 16666 states and 50150 transitions. Word has length 33 [2019-12-18 14:53:41,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:41,755 INFO L462 AbstractCegarLoop]: Abstraction has 16666 states and 50150 transitions. [2019-12-18 14:53:41,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:53:41,755 INFO L276 IsEmpty]: Start isEmpty. Operand 16666 states and 50150 transitions. [2019-12-18 14:53:41,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-18 14:53:41,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:41,776 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] [2019-12-18 14:53:41,776 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:41,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:41,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1641373212, now seen corresponding path program 1 times [2019-12-18 14:53:41,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:41,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951765336] [2019-12-18 14:53:41,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:41,837 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 14:53:41,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951765336] [2019-12-18 14:53:41,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:41,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:53:41,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124847673] [2019-12-18 14:53:41,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:53:41,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:53:41,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:53:41,839 INFO L87 Difference]: Start difference. First operand 16666 states and 50150 transitions. Second operand 3 states. [2019-12-18 14:53:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:41,903 INFO L93 Difference]: Finished difference Result 16665 states and 50148 transitions. [2019-12-18 14:53:41,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:53:41,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-18 14:53:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:41,934 INFO L225 Difference]: With dead ends: 16665 [2019-12-18 14:53:41,934 INFO L226 Difference]: Without dead ends: 16665 [2019-12-18 14:53:41,935 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 14:53:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16665 states. [2019-12-18 14:53:42,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16665 to 16665. [2019-12-18 14:53:42,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16665 states. [2019-12-18 14:53:42,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16665 states to 16665 states and 50148 transitions. [2019-12-18 14:53:42,200 INFO L78 Accepts]: Start accepts. Automaton has 16665 states and 50148 transitions. Word has length 39 [2019-12-18 14:53:42,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:42,200 INFO L462 AbstractCegarLoop]: Abstraction has 16665 states and 50148 transitions. [2019-12-18 14:53:42,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:53:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16665 states and 50148 transitions. [2019-12-18 14:53:42,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:53:42,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:42,221 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] [2019-12-18 14:53:42,221 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:42,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:42,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1450973103, now seen corresponding path program 1 times [2019-12-18 14:53:42,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:42,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488039640] [2019-12-18 14:53:42,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:42,296 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 14:53:42,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488039640] [2019-12-18 14:53:42,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:42,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:53:42,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302887367] [2019-12-18 14:53:42,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:53:42,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:42,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:53:42,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:53:42,300 INFO L87 Difference]: Start difference. First operand 16665 states and 50148 transitions. Second operand 4 states. [2019-12-18 14:53:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:42,455 INFO L93 Difference]: Finished difference Result 31503 states and 94864 transitions. [2019-12-18 14:53:42,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:53:42,456 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-18 14:53:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:42,490 INFO L225 Difference]: With dead ends: 31503 [2019-12-18 14:53:42,490 INFO L226 Difference]: Without dead ends: 16332 [2019-12-18 14:53:42,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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 14:53:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16332 states. [2019-12-18 14:53:42,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16332 to 16328. [2019-12-18 14:53:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-12-18 14:53:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 48458 transitions. [2019-12-18 14:53:42,804 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 48458 transitions. Word has length 40 [2019-12-18 14:53:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:42,805 INFO L462 AbstractCegarLoop]: Abstraction has 16328 states and 48458 transitions. [2019-12-18 14:53:42,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:53:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 48458 transitions. [2019-12-18 14:53:42,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:53:42,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:42,820 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] [2019-12-18 14:53:42,820 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:42,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:42,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1753570543, now seen corresponding path program 2 times [2019-12-18 14:53:42,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:42,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189195499] [2019-12-18 14:53:42,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:42,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:42,902 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 14:53:42,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189195499] [2019-12-18 14:53:42,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:42,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:53:42,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767994686] [2019-12-18 14:53:42,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:53:42,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:42,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:53:42,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:53:42,904 INFO L87 Difference]: Start difference. First operand 16328 states and 48458 transitions. Second operand 5 states. [2019-12-18 14:53:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:43,689 INFO L93 Difference]: Finished difference Result 22499 states and 66522 transitions. [2019-12-18 14:53:43,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:53:43,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:53:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:43,721 INFO L225 Difference]: With dead ends: 22499 [2019-12-18 14:53:43,721 INFO L226 Difference]: Without dead ends: 22499 [2019-12-18 14:53:43,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:53:43,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22499 states. [2019-12-18 14:53:44,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22499 to 21006. [2019-12-18 14:53:44,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21006 states. [2019-12-18 14:53:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21006 states to 21006 states and 62454 transitions. [2019-12-18 14:53:44,073 INFO L78 Accepts]: Start accepts. Automaton has 21006 states and 62454 transitions. Word has length 40 [2019-12-18 14:53:44,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:44,073 INFO L462 AbstractCegarLoop]: Abstraction has 21006 states and 62454 transitions. [2019-12-18 14:53:44,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:53:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 21006 states and 62454 transitions. [2019-12-18 14:53:44,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-18 14:53:44,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:44,095 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] [2019-12-18 14:53:44,095 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:44,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:44,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1960596885, now seen corresponding path program 3 times [2019-12-18 14:53:44,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:44,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230281823] [2019-12-18 14:53:44,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:44,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:44,160 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 14:53:44,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230281823] [2019-12-18 14:53:44,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:44,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:53:44,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400017033] [2019-12-18 14:53:44,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:53:44,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:44,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:53:44,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:53:44,162 INFO L87 Difference]: Start difference. First operand 21006 states and 62454 transitions. Second operand 5 states. [2019-12-18 14:53:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:44,261 INFO L93 Difference]: Finished difference Result 19781 states and 59627 transitions. [2019-12-18 14:53:44,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:53:44,261 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-18 14:53:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:44,288 INFO L225 Difference]: With dead ends: 19781 [2019-12-18 14:53:44,288 INFO L226 Difference]: Without dead ends: 19287 [2019-12-18 14:53:44,288 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 14:53:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19287 states. [2019-12-18 14:53:44,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19287 to 18447. [2019-12-18 14:53:44,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18447 states. [2019-12-18 14:53:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 56396 transitions. [2019-12-18 14:53:44,593 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 56396 transitions. Word has length 40 [2019-12-18 14:53:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:44,593 INFO L462 AbstractCegarLoop]: Abstraction has 18447 states and 56396 transitions. [2019-12-18 14:53:44,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:53:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 56396 transitions. [2019-12-18 14:53:44,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:53:44,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:44,622 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:44,622 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:44,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:44,623 INFO L82 PathProgramCache]: Analyzing trace with hash -48564843, now seen corresponding path program 1 times [2019-12-18 14:53:44,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:44,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504926912] [2019-12-18 14:53:44,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:44,676 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 14:53:44,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504926912] [2019-12-18 14:53:44,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:44,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:53:44,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131253704] [2019-12-18 14:53:44,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:53:44,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:44,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:53:44,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:53:44,678 INFO L87 Difference]: Start difference. First operand 18447 states and 56396 transitions. Second operand 3 states. [2019-12-18 14:53:44,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:44,827 INFO L93 Difference]: Finished difference Result 27408 states and 83933 transitions. [2019-12-18 14:53:44,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:53:44,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:53:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:44,880 INFO L225 Difference]: With dead ends: 27408 [2019-12-18 14:53:44,880 INFO L226 Difference]: Without dead ends: 27408 [2019-12-18 14:53:44,881 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 14:53:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27408 states. [2019-12-18 14:53:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27408 to 20833. [2019-12-18 14:53:45,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20833 states. [2019-12-18 14:53:45,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20833 states to 20833 states and 64483 transitions. [2019-12-18 14:53:45,299 INFO L78 Accepts]: Start accepts. Automaton has 20833 states and 64483 transitions. Word has length 64 [2019-12-18 14:53:45,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:45,300 INFO L462 AbstractCegarLoop]: Abstraction has 20833 states and 64483 transitions. [2019-12-18 14:53:45,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:53:45,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20833 states and 64483 transitions. [2019-12-18 14:53:45,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:53:45,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:45,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, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:45,329 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:45,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:45,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1559426519, now seen corresponding path program 1 times [2019-12-18 14:53:45,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:45,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375151745] [2019-12-18 14:53:45,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:45,416 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 14:53:45,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375151745] [2019-12-18 14:53:45,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:45,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:53:45,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510497646] [2019-12-18 14:53:45,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:53:45,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:45,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:53:45,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:53:45,418 INFO L87 Difference]: Start difference. First operand 20833 states and 64483 transitions. Second operand 7 states. [2019-12-18 14:53:45,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:45,977 INFO L93 Difference]: Finished difference Result 61323 states and 187457 transitions. [2019-12-18 14:53:45,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 14:53:45,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:53:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:46,064 INFO L225 Difference]: With dead ends: 61323 [2019-12-18 14:53:46,065 INFO L226 Difference]: Without dead ends: 42147 [2019-12-18 14:53:46,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 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 14:53:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42147 states. [2019-12-18 14:53:46,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42147 to 23713. [2019-12-18 14:53:46,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23713 states. [2019-12-18 14:53:46,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23713 states to 23713 states and 73274 transitions. [2019-12-18 14:53:46,871 INFO L78 Accepts]: Start accepts. Automaton has 23713 states and 73274 transitions. Word has length 64 [2019-12-18 14:53:46,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:46,872 INFO L462 AbstractCegarLoop]: Abstraction has 23713 states and 73274 transitions. [2019-12-18 14:53:46,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:53:46,872 INFO L276 IsEmpty]: Start isEmpty. Operand 23713 states and 73274 transitions. [2019-12-18 14:53:46,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:53:46,900 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:46,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:46,901 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:46,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:46,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1388462743, now seen corresponding path program 2 times [2019-12-18 14:53:46,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:46,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207644058] [2019-12-18 14:53:46,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:46,988 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 14:53:46,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207644058] [2019-12-18 14:53:46,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:46,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:53:46,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634653542] [2019-12-18 14:53:46,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:53:46,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:53:46,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:53:46,990 INFO L87 Difference]: Start difference. First operand 23713 states and 73274 transitions. Second operand 7 states. [2019-12-18 14:53:47,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:47,635 INFO L93 Difference]: Finished difference Result 68574 states and 211095 transitions. [2019-12-18 14:53:47,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-18 14:53:47,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:53:47,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:47,715 INFO L225 Difference]: With dead ends: 68574 [2019-12-18 14:53:47,716 INFO L226 Difference]: Without dead ends: 51641 [2019-12-18 14:53:47,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:53:47,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51641 states. [2019-12-18 14:53:48,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51641 to 27716. [2019-12-18 14:53:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27716 states. [2019-12-18 14:53:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27716 states to 27716 states and 86140 transitions. [2019-12-18 14:53:48,350 INFO L78 Accepts]: Start accepts. Automaton has 27716 states and 86140 transitions. Word has length 64 [2019-12-18 14:53:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:48,351 INFO L462 AbstractCegarLoop]: Abstraction has 27716 states and 86140 transitions. [2019-12-18 14:53:48,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:53:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 27716 states and 86140 transitions. [2019-12-18 14:53:48,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:53:48,382 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:48,382 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:48,382 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:48,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:48,382 INFO L82 PathProgramCache]: Analyzing trace with hash -317627445, now seen corresponding path program 3 times [2019-12-18 14:53:48,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:48,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156746607] [2019-12-18 14:53:48,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:48,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:48,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 14:53:48,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156746607] [2019-12-18 14:53:48,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:48,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:53:48,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939523221] [2019-12-18 14:53:48,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:53:48,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:48,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:53:48,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:53:48,479 INFO L87 Difference]: Start difference. First operand 27716 states and 86140 transitions. Second operand 7 states. [2019-12-18 14:53:48,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:48,959 INFO L93 Difference]: Finished difference Result 58876 states and 180784 transitions. [2019-12-18 14:53:48,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:53:48,959 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-18 14:53:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:49,039 INFO L225 Difference]: With dead ends: 58876 [2019-12-18 14:53:49,040 INFO L226 Difference]: Without dead ends: 51661 [2019-12-18 14:53:49,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-18 14:53:49,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51661 states. [2019-12-18 14:53:49,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51661 to 28024. [2019-12-18 14:53:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28024 states. [2019-12-18 14:53:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28024 states to 28024 states and 87091 transitions. [2019-12-18 14:53:49,988 INFO L78 Accepts]: Start accepts. Automaton has 28024 states and 87091 transitions. Word has length 64 [2019-12-18 14:53:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:49,988 INFO L462 AbstractCegarLoop]: Abstraction has 28024 states and 87091 transitions. [2019-12-18 14:53:49,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:53:49,988 INFO L276 IsEmpty]: Start isEmpty. Operand 28024 states and 87091 transitions. [2019-12-18 14:53:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-18 14:53:50,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:50,019 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:50,019 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:50,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:50,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1087297877, now seen corresponding path program 4 times [2019-12-18 14:53:50,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:50,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916835343] [2019-12-18 14:53:50,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:50,082 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 14:53:50,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916835343] [2019-12-18 14:53:50,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:50,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:53:50,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950660182] [2019-12-18 14:53:50,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:53:50,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:50,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:53:50,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:53:50,088 INFO L87 Difference]: Start difference. First operand 28024 states and 87091 transitions. Second operand 3 states. [2019-12-18 14:53:50,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:50,244 INFO L93 Difference]: Finished difference Result 33789 states and 104171 transitions. [2019-12-18 14:53:50,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:53:50,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-18 14:53:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:50,292 INFO L225 Difference]: With dead ends: 33789 [2019-12-18 14:53:50,292 INFO L226 Difference]: Without dead ends: 33789 [2019-12-18 14:53:50,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 14:53:50,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33789 states. [2019-12-18 14:53:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33789 to 29603. [2019-12-18 14:53:50,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29603 states. [2019-12-18 14:53:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29603 states to 29603 states and 91943 transitions. [2019-12-18 14:53:50,810 INFO L78 Accepts]: Start accepts. Automaton has 29603 states and 91943 transitions. Word has length 64 [2019-12-18 14:53:50,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:50,811 INFO L462 AbstractCegarLoop]: Abstraction has 29603 states and 91943 transitions. [2019-12-18 14:53:50,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:53:50,811 INFO L276 IsEmpty]: Start isEmpty. Operand 29603 states and 91943 transitions. [2019-12-18 14:53:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:53:50,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:50,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, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:50,861 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:50,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:50,862 INFO L82 PathProgramCache]: Analyzing trace with hash -181535548, now seen corresponding path program 1 times [2019-12-18 14:53:50,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:50,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111384004] [2019-12-18 14:53:50,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:50,911 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 14:53:50,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111384004] [2019-12-18 14:53:50,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:50,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:53:50,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015783784] [2019-12-18 14:53:50,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:53:50,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:53:50,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:53:50,913 INFO L87 Difference]: Start difference. First operand 29603 states and 91943 transitions. Second operand 4 states. [2019-12-18 14:53:51,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:51,260 INFO L93 Difference]: Finished difference Result 45817 states and 143094 transitions. [2019-12-18 14:53:51,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:53:51,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 14:53:51,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:51,334 INFO L225 Difference]: With dead ends: 45817 [2019-12-18 14:53:51,334 INFO L226 Difference]: Without dead ends: 45817 [2019-12-18 14:53:51,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 14:53:51,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45817 states. [2019-12-18 14:53:51,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45817 to 31959. [2019-12-18 14:53:51,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31959 states. [2019-12-18 14:53:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31959 states to 31959 states and 100397 transitions. [2019-12-18 14:53:51,989 INFO L78 Accepts]: Start accepts. Automaton has 31959 states and 100397 transitions. Word has length 65 [2019-12-18 14:53:51,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:51,989 INFO L462 AbstractCegarLoop]: Abstraction has 31959 states and 100397 transitions. [2019-12-18 14:53:51,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:53:51,990 INFO L276 IsEmpty]: Start isEmpty. Operand 31959 states and 100397 transitions. [2019-12-18 14:53:52,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:53:52,024 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:52,024 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:52,024 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:52,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:52,024 INFO L82 PathProgramCache]: Analyzing trace with hash -701292531, now seen corresponding path program 1 times [2019-12-18 14:53:52,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:52,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406184236] [2019-12-18 14:53:52,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:52,122 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 14:53:52,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406184236] [2019-12-18 14:53:52,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:52,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:53:52,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492353239] [2019-12-18 14:53:52,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:53:52,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:52,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:53:52,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:53:52,124 INFO L87 Difference]: Start difference. First operand 31959 states and 100397 transitions. Second operand 7 states. [2019-12-18 14:53:53,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:53,120 INFO L93 Difference]: Finished difference Result 69632 states and 216004 transitions. [2019-12-18 14:53:53,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 14:53:53,121 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 14:53:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:53,218 INFO L225 Difference]: With dead ends: 69632 [2019-12-18 14:53:53,218 INFO L226 Difference]: Without dead ends: 63631 [2019-12-18 14:53:53,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-18 14:53:53,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63631 states. [2019-12-18 14:53:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63631 to 31991. [2019-12-18 14:53:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31991 states. [2019-12-18 14:53:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31991 states to 31991 states and 100515 transitions. [2019-12-18 14:53:53,947 INFO L78 Accepts]: Start accepts. Automaton has 31991 states and 100515 transitions. Word has length 65 [2019-12-18 14:53:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:53,947 INFO L462 AbstractCegarLoop]: Abstraction has 31991 states and 100515 transitions. [2019-12-18 14:53:53,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:53:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 31991 states and 100515 transitions. [2019-12-18 14:53:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:53:53,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:53,982 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:53,982 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:53,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:53,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1336640005, now seen corresponding path program 2 times [2019-12-18 14:53:53,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:53,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33951890] [2019-12-18 14:53:53,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:54,107 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 14:53:54,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33951890] [2019-12-18 14:53:54,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:54,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:53:54,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900385447] [2019-12-18 14:53:54,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:53:54,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:54,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:53:54,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:53:54,109 INFO L87 Difference]: Start difference. First operand 31991 states and 100515 transitions. Second operand 7 states. [2019-12-18 14:53:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:54,890 INFO L93 Difference]: Finished difference Result 44848 states and 139960 transitions. [2019-12-18 14:53:54,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:53:54,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 14:53:54,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:54,958 INFO L225 Difference]: With dead ends: 44848 [2019-12-18 14:53:54,958 INFO L226 Difference]: Without dead ends: 44844 [2019-12-18 14:53:54,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:53:55,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44844 states. [2019-12-18 14:53:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44844 to 32249. [2019-12-18 14:53:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32249 states. [2019-12-18 14:53:55,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32249 states to 32249 states and 99750 transitions. [2019-12-18 14:53:55,582 INFO L78 Accepts]: Start accepts. Automaton has 32249 states and 99750 transitions. Word has length 65 [2019-12-18 14:53:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:55,582 INFO L462 AbstractCegarLoop]: Abstraction has 32249 states and 99750 transitions. [2019-12-18 14:53:55,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:53:55,582 INFO L276 IsEmpty]: Start isEmpty. Operand 32249 states and 99750 transitions. [2019-12-18 14:53:55,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:53:55,620 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:55,620 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:55,620 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:55,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:55,620 INFO L82 PathProgramCache]: Analyzing trace with hash -152741241, now seen corresponding path program 1 times [2019-12-18 14:53:55,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:55,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158543849] [2019-12-18 14:53:55,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:55,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:55,663 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 14:53:55,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158543849] [2019-12-18 14:53:55,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:55,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:53:55,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197535413] [2019-12-18 14:53:55,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:53:55,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:55,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:53:55,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:53:55,665 INFO L87 Difference]: Start difference. First operand 32249 states and 99750 transitions. Second operand 3 states. [2019-12-18 14:53:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:55,899 INFO L93 Difference]: Finished difference Result 43160 states and 132643 transitions. [2019-12-18 14:53:55,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:53:55,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:53:55,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:55,963 INFO L225 Difference]: With dead ends: 43160 [2019-12-18 14:53:55,963 INFO L226 Difference]: Without dead ends: 43160 [2019-12-18 14:53:55,963 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 14:53:56,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43160 states. [2019-12-18 14:53:56,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43160 to 32489. [2019-12-18 14:53:56,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32489 states. [2019-12-18 14:53:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32489 states to 32489 states and 100545 transitions. [2019-12-18 14:53:56,875 INFO L78 Accepts]: Start accepts. Automaton has 32489 states and 100545 transitions. Word has length 65 [2019-12-18 14:53:56,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:56,876 INFO L462 AbstractCegarLoop]: Abstraction has 32489 states and 100545 transitions. [2019-12-18 14:53:56,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:53:56,876 INFO L276 IsEmpty]: Start isEmpty. Operand 32489 states and 100545 transitions. [2019-12-18 14:53:56,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:53:56,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:56,912 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:56,912 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:56,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:56,912 INFO L82 PathProgramCache]: Analyzing trace with hash -422803263, now seen corresponding path program 2 times [2019-12-18 14:53:56,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:56,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621882619] [2019-12-18 14:53:56,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:56,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:57,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:53:57,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621882619] [2019-12-18 14:53:57,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:57,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 14:53:57,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974823741] [2019-12-18 14:53:57,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:53:57,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:53:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:53:57,009 INFO L87 Difference]: Start difference. First operand 32489 states and 100545 transitions. Second operand 7 states. [2019-12-18 14:53:57,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:57,876 INFO L93 Difference]: Finished difference Result 52071 states and 162140 transitions. [2019-12-18 14:53:57,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:53:57,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-18 14:53:57,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:57,990 INFO L225 Difference]: With dead ends: 52071 [2019-12-18 14:53:57,990 INFO L226 Difference]: Without dead ends: 52071 [2019-12-18 14:53:57,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:53:58,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52071 states. [2019-12-18 14:53:58,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52071 to 33507. [2019-12-18 14:53:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33507 states. [2019-12-18 14:53:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33507 states to 33507 states and 103713 transitions. [2019-12-18 14:53:58,749 INFO L78 Accepts]: Start accepts. Automaton has 33507 states and 103713 transitions. Word has length 65 [2019-12-18 14:53:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:58,749 INFO L462 AbstractCegarLoop]: Abstraction has 33507 states and 103713 transitions. [2019-12-18 14:53:58,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:53:58,749 INFO L276 IsEmpty]: Start isEmpty. Operand 33507 states and 103713 transitions. [2019-12-18 14:53:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:53:58,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:58,787 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:58,788 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1008271868, now seen corresponding path program 1 times [2019-12-18 14:53:58,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:58,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924989616] [2019-12-18 14:53:58,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:58,856 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 14:53:58,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924989616] [2019-12-18 14:53:58,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:58,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:53:58,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639759914] [2019-12-18 14:53:58,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:53:58,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:58,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:53:58,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:53:58,860 INFO L87 Difference]: Start difference. First operand 33507 states and 103713 transitions. Second operand 4 states. [2019-12-18 14:53:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:53:59,024 INFO L93 Difference]: Finished difference Result 33507 states and 103505 transitions. [2019-12-18 14:53:59,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:53:59,024 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-18 14:53:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:53:59,071 INFO L225 Difference]: With dead ends: 33507 [2019-12-18 14:53:59,072 INFO L226 Difference]: Without dead ends: 33507 [2019-12-18 14:53:59,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:53:59,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33507 states. [2019-12-18 14:53:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33507 to 28069. [2019-12-18 14:53:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28069 states. [2019-12-18 14:53:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28069 states to 28069 states and 85930 transitions. [2019-12-18 14:53:59,558 INFO L78 Accepts]: Start accepts. Automaton has 28069 states and 85930 transitions. Word has length 65 [2019-12-18 14:53:59,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:53:59,559 INFO L462 AbstractCegarLoop]: Abstraction has 28069 states and 85930 transitions. [2019-12-18 14:53:59,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:53:59,559 INFO L276 IsEmpty]: Start isEmpty. Operand 28069 states and 85930 transitions. [2019-12-18 14:53:59,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:53:59,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:53:59,592 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:53:59,592 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:53:59,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:53:59,593 INFO L82 PathProgramCache]: Analyzing trace with hash 148182117, now seen corresponding path program 1 times [2019-12-18 14:53:59,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:53:59,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742371735] [2019-12-18 14:53:59,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:53:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:53:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:53:59,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742371735] [2019-12-18 14:53:59,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:53:59,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:53:59,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206786651] [2019-12-18 14:53:59,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:53:59,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:53:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:53:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:53:59,661 INFO L87 Difference]: Start difference. First operand 28069 states and 85930 transitions. Second operand 5 states. [2019-12-18 14:54:00,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:00,428 INFO L93 Difference]: Finished difference Result 40500 states and 121827 transitions. [2019-12-18 14:54:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:54:00,428 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:54:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:00,485 INFO L225 Difference]: With dead ends: 40500 [2019-12-18 14:54:00,485 INFO L226 Difference]: Without dead ends: 40276 [2019-12-18 14:54:00,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:54:00,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40276 states. [2019-12-18 14:54:00,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40276 to 32300. [2019-12-18 14:54:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32300 states. [2019-12-18 14:54:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32300 states to 32300 states and 98642 transitions. [2019-12-18 14:54:01,063 INFO L78 Accepts]: Start accepts. Automaton has 32300 states and 98642 transitions. Word has length 65 [2019-12-18 14:54:01,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:01,064 INFO L462 AbstractCegarLoop]: Abstraction has 32300 states and 98642 transitions. [2019-12-18 14:54:01,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:54:01,064 INFO L276 IsEmpty]: Start isEmpty. Operand 32300 states and 98642 transitions. [2019-12-18 14:54:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:54:01,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:01,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:01,101 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:01,102 INFO L82 PathProgramCache]: Analyzing trace with hash -272998531, now seen corresponding path program 2 times [2019-12-18 14:54:01,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:01,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501684880] [2019-12-18 14:54:01,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:01,215 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 14:54:01,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501684880] [2019-12-18 14:54:01,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:01,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:54:01,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235175056] [2019-12-18 14:54:01,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 14:54:01,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:01,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 14:54:01,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:54:01,218 INFO L87 Difference]: Start difference. First operand 32300 states and 98642 transitions. Second operand 8 states. [2019-12-18 14:54:02,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:02,594 INFO L93 Difference]: Finished difference Result 49096 states and 148270 transitions. [2019-12-18 14:54:02,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 14:54:02,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-18 14:54:02,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:02,666 INFO L225 Difference]: With dead ends: 49096 [2019-12-18 14:54:02,667 INFO L226 Difference]: Without dead ends: 49000 [2019-12-18 14:54:02,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:54:02,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49000 states. [2019-12-18 14:54:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49000 to 33469. [2019-12-18 14:54:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33469 states. [2019-12-18 14:54:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33469 states to 33469 states and 102034 transitions. [2019-12-18 14:54:03,298 INFO L78 Accepts]: Start accepts. Automaton has 33469 states and 102034 transitions. Word has length 65 [2019-12-18 14:54:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:03,299 INFO L462 AbstractCegarLoop]: Abstraction has 33469 states and 102034 transitions. [2019-12-18 14:54:03,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 14:54:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 33469 states and 102034 transitions. [2019-12-18 14:54:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:54:03,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:03,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:03,333 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:03,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:03,333 INFO L82 PathProgramCache]: Analyzing trace with hash 312846933, now seen corresponding path program 3 times [2019-12-18 14:54:03,336 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:03,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876608035] [2019-12-18 14:54:03,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:03,479 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 14:54:03,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876608035] [2019-12-18 14:54:03,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:03,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:54:03,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836070929] [2019-12-18 14:54:03,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:54:03,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:03,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:54:03,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:54:03,482 INFO L87 Difference]: Start difference. First operand 33469 states and 102034 transitions. Second operand 10 states. [2019-12-18 14:54:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:06,193 INFO L93 Difference]: Finished difference Result 51752 states and 155487 transitions. [2019-12-18 14:54:06,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-18 14:54:06,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-18 14:54:06,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:06,267 INFO L225 Difference]: With dead ends: 51752 [2019-12-18 14:54:06,267 INFO L226 Difference]: Without dead ends: 51444 [2019-12-18 14:54:06,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2019-12-18 14:54:06,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51444 states. [2019-12-18 14:54:06,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51444 to 36360. [2019-12-18 14:54:06,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36360 states. [2019-12-18 14:54:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36360 states to 36360 states and 110560 transitions. [2019-12-18 14:54:06,958 INFO L78 Accepts]: Start accepts. Automaton has 36360 states and 110560 transitions. Word has length 65 [2019-12-18 14:54:06,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:06,958 INFO L462 AbstractCegarLoop]: Abstraction has 36360 states and 110560 transitions. [2019-12-18 14:54:06,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:54:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 36360 states and 110560 transitions. [2019-12-18 14:54:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:54:06,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:06,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:06,997 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:06,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1178106421, now seen corresponding path program 4 times [2019-12-18 14:54:06,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:06,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090238264] [2019-12-18 14:54:06,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:07,053 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 14:54:07,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090238264] [2019-12-18 14:54:07,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:07,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:54:07,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582246712] [2019-12-18 14:54:07,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:54:07,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:07,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:54:07,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:07,055 INFO L87 Difference]: Start difference. First operand 36360 states and 110560 transitions. Second operand 3 states. [2019-12-18 14:54:07,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:07,214 INFO L93 Difference]: Finished difference Result 36360 states and 110559 transitions. [2019-12-18 14:54:07,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:54:07,215 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:54:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:07,282 INFO L225 Difference]: With dead ends: 36360 [2019-12-18 14:54:07,283 INFO L226 Difference]: Without dead ends: 36360 [2019-12-18 14:54:07,283 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 14:54:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36360 states. [2019-12-18 14:54:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36360 to 29373. [2019-12-18 14:54:07,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29373 states. [2019-12-18 14:54:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29373 states to 29373 states and 91197 transitions. [2019-12-18 14:54:07,808 INFO L78 Accepts]: Start accepts. Automaton has 29373 states and 91197 transitions. Word has length 65 [2019-12-18 14:54:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:07,808 INFO L462 AbstractCegarLoop]: Abstraction has 29373 states and 91197 transitions. [2019-12-18 14:54:07,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:54:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 29373 states and 91197 transitions. [2019-12-18 14:54:07,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:54:07,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:07,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:07,840 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:07,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:07,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1560089001, now seen corresponding path program 1 times [2019-12-18 14:54:07,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:07,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819171872] [2019-12-18 14:54:07,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:08,009 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 14:54:08,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819171872] [2019-12-18 14:54:08,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:08,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-18 14:54:08,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699268263] [2019-12-18 14:54:08,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:54:08,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:08,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:54:08,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:54:08,011 INFO L87 Difference]: Start difference. First operand 29373 states and 91197 transitions. Second operand 11 states. [2019-12-18 14:54:10,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:10,308 INFO L93 Difference]: Finished difference Result 46019 states and 140289 transitions. [2019-12-18 14:54:10,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-18 14:54:10,308 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-18 14:54:10,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:10,372 INFO L225 Difference]: With dead ends: 46019 [2019-12-18 14:54:10,372 INFO L226 Difference]: Without dead ends: 46019 [2019-12-18 14:54:10,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=429, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:54:10,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46019 states. [2019-12-18 14:54:11,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46019 to 29884. [2019-12-18 14:54:11,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29884 states. [2019-12-18 14:54:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29884 states to 29884 states and 92931 transitions. [2019-12-18 14:54:11,249 INFO L78 Accepts]: Start accepts. Automaton has 29884 states and 92931 transitions. Word has length 66 [2019-12-18 14:54:11,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:11,249 INFO L462 AbstractCegarLoop]: Abstraction has 29884 states and 92931 transitions. [2019-12-18 14:54:11,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:54:11,249 INFO L276 IsEmpty]: Start isEmpty. Operand 29884 states and 92931 transitions. [2019-12-18 14:54:11,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:54:11,281 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:11,281 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:11,281 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:11,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:11,281 INFO L82 PathProgramCache]: Analyzing trace with hash -353775189, now seen corresponding path program 2 times [2019-12-18 14:54:11,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:11,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481386132] [2019-12-18 14:54:11,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:11,342 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 14:54:11,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481386132] [2019-12-18 14:54:11,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:11,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:54:11,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310594183] [2019-12-18 14:54:11,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:54:11,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:11,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:54:11,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:54:11,344 INFO L87 Difference]: Start difference. First operand 29884 states and 92931 transitions. Second operand 3 states. [2019-12-18 14:54:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:11,437 INFO L93 Difference]: Finished difference Result 23659 states and 72294 transitions. [2019-12-18 14:54:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:54:11,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:54:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:11,467 INFO L225 Difference]: With dead ends: 23659 [2019-12-18 14:54:11,467 INFO L226 Difference]: Without dead ends: 23659 [2019-12-18 14:54:11,468 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 14:54:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23659 states. [2019-12-18 14:54:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23659 to 22516. [2019-12-18 14:54:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22516 states. [2019-12-18 14:54:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22516 states to 22516 states and 68726 transitions. [2019-12-18 14:54:11,803 INFO L78 Accepts]: Start accepts. Automaton has 22516 states and 68726 transitions. Word has length 66 [2019-12-18 14:54:11,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:11,804 INFO L462 AbstractCegarLoop]: Abstraction has 22516 states and 68726 transitions. [2019-12-18 14:54:11,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:54:11,804 INFO L276 IsEmpty]: Start isEmpty. Operand 22516 states and 68726 transitions. [2019-12-18 14:54:11,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:11,824 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:11,825 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:54:11,825 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:11,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:11,825 INFO L82 PathProgramCache]: Analyzing trace with hash -2007326845, now seen corresponding path program 1 times [2019-12-18 14:54:11,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:11,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354164686] [2019-12-18 14:54:11,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:12,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:12,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354164686] [2019-12-18 14:54:12,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:12,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:54:12,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651990829] [2019-12-18 14:54:12,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:54:12,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:12,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:54:12,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:54:12,492 INFO L87 Difference]: Start difference. First operand 22516 states and 68726 transitions. Second operand 17 states. [2019-12-18 14:54:15,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:15,268 INFO L93 Difference]: Finished difference Result 28485 states and 86120 transitions. [2019-12-18 14:54:15,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-18 14:54:15,268 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 14:54:15,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:15,302 INFO L225 Difference]: With dead ends: 28485 [2019-12-18 14:54:15,302 INFO L226 Difference]: Without dead ends: 25482 [2019-12-18 14:54:15,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=407, Invalid=1663, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 14:54:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25482 states. [2019-12-18 14:54:15,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25482 to 23022. [2019-12-18 14:54:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23022 states. [2019-12-18 14:54:15,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23022 states to 23022 states and 70032 transitions. [2019-12-18 14:54:15,633 INFO L78 Accepts]: Start accepts. Automaton has 23022 states and 70032 transitions. Word has length 67 [2019-12-18 14:54:15,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:15,634 INFO L462 AbstractCegarLoop]: Abstraction has 23022 states and 70032 transitions. [2019-12-18 14:54:15,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:54:15,634 INFO L276 IsEmpty]: Start isEmpty. Operand 23022 states and 70032 transitions. [2019-12-18 14:54:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:15,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:15,655 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:15,655 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:15,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1473001563, now seen corresponding path program 2 times [2019-12-18 14:54:15,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:15,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595205713] [2019-12-18 14:54:15,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:15,999 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 14:54:16,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595205713] [2019-12-18 14:54:16,000 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:16,000 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:54:16,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083685923] [2019-12-18 14:54:16,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:54:16,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:16,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:54:16,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:54:16,001 INFO L87 Difference]: Start difference. First operand 23022 states and 70032 transitions. Second operand 15 states. [2019-12-18 14:54:20,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:20,949 INFO L93 Difference]: Finished difference Result 48671 states and 146696 transitions. [2019-12-18 14:54:20,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 14:54:20,949 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 14:54:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:21,004 INFO L225 Difference]: With dead ends: 48671 [2019-12-18 14:54:21,005 INFO L226 Difference]: Without dead ends: 40833 [2019-12-18 14:54:21,006 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=620, Invalid=3412, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 14:54:21,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40833 states. [2019-12-18 14:54:21,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40833 to 23094. [2019-12-18 14:54:21,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23094 states. [2019-12-18 14:54:21,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23094 states to 23094 states and 70119 transitions. [2019-12-18 14:54:21,476 INFO L78 Accepts]: Start accepts. Automaton has 23094 states and 70119 transitions. Word has length 67 [2019-12-18 14:54:21,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:21,476 INFO L462 AbstractCegarLoop]: Abstraction has 23094 states and 70119 transitions. [2019-12-18 14:54:21,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:54:21,476 INFO L276 IsEmpty]: Start isEmpty. Operand 23094 states and 70119 transitions. [2019-12-18 14:54:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:21,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:21,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:21,503 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:21,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1156108883, now seen corresponding path program 3 times [2019-12-18 14:54:21,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:21,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456193762] [2019-12-18 14:54:21,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:21,896 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 14:54:21,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456193762] [2019-12-18 14:54:21,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:21,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:54:21,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528486614] [2019-12-18 14:54:21,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:54:21,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:21,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:54:21,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:54:21,898 INFO L87 Difference]: Start difference. First operand 23094 states and 70119 transitions. Second operand 16 states. [2019-12-18 14:54:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:25,437 INFO L93 Difference]: Finished difference Result 29919 states and 89399 transitions. [2019-12-18 14:54:25,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-18 14:54:25,437 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 14:54:25,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:25,474 INFO L225 Difference]: With dead ends: 29919 [2019-12-18 14:54:25,474 INFO L226 Difference]: Without dead ends: 29294 [2019-12-18 14:54:25,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 615 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=436, Invalid=1820, Unknown=0, NotChecked=0, Total=2256 [2019-12-18 14:54:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29294 states. [2019-12-18 14:54:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29294 to 22854. [2019-12-18 14:54:25,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22854 states. [2019-12-18 14:54:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22854 states to 22854 states and 69463 transitions. [2019-12-18 14:54:25,857 INFO L78 Accepts]: Start accepts. Automaton has 22854 states and 69463 transitions. Word has length 67 [2019-12-18 14:54:25,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:25,857 INFO L462 AbstractCegarLoop]: Abstraction has 22854 states and 69463 transitions. [2019-12-18 14:54:25,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:54:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 22854 states and 69463 transitions. [2019-12-18 14:54:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:25,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:25,882 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:25,882 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1816499453, now seen corresponding path program 4 times [2019-12-18 14:54:25,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:25,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641084067] [2019-12-18 14:54:25,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:26,235 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 14:54:26,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641084067] [2019-12-18 14:54:26,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:26,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:54:26,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839876618] [2019-12-18 14:54:26,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:54:26,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:26,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:54:26,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:54:26,237 INFO L87 Difference]: Start difference. First operand 22854 states and 69463 transitions. Second operand 15 states. [2019-12-18 14:54:26,521 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2019-12-18 14:54:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:31,726 INFO L93 Difference]: Finished difference Result 54639 states and 165903 transitions. [2019-12-18 14:54:31,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-18 14:54:31,727 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 14:54:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:31,803 INFO L225 Difference]: With dead ends: 54639 [2019-12-18 14:54:31,803 INFO L226 Difference]: Without dead ends: 52424 [2019-12-18 14:54:31,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=576, Invalid=3456, Unknown=0, NotChecked=0, Total=4032 [2019-12-18 14:54:31,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52424 states. [2019-12-18 14:54:32,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52424 to 28484. [2019-12-18 14:54:32,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28484 states. [2019-12-18 14:54:32,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28484 states to 28484 states and 87131 transitions. [2019-12-18 14:54:32,451 INFO L78 Accepts]: Start accepts. Automaton has 28484 states and 87131 transitions. Word has length 67 [2019-12-18 14:54:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:32,451 INFO L462 AbstractCegarLoop]: Abstraction has 28484 states and 87131 transitions. [2019-12-18 14:54:32,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:54:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 28484 states and 87131 transitions. [2019-12-18 14:54:32,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:32,486 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:32,486 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:32,487 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:32,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:32,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1315765029, now seen corresponding path program 5 times [2019-12-18 14:54:32,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:32,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771295482] [2019-12-18 14:54:32,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:32,985 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 14:54:32,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771295482] [2019-12-18 14:54:32,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:32,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:54:32,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227428015] [2019-12-18 14:54:32,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:54:32,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:32,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:54:32,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:54:32,988 INFO L87 Difference]: Start difference. First operand 28484 states and 87131 transitions. Second operand 16 states. [2019-12-18 14:54:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:37,175 INFO L93 Difference]: Finished difference Result 41315 states and 124333 transitions. [2019-12-18 14:54:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 14:54:37,175 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 14:54:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:37,220 INFO L225 Difference]: With dead ends: 41315 [2019-12-18 14:54:37,220 INFO L226 Difference]: Without dead ends: 34598 [2019-12-18 14:54:37,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 532 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=364, Invalid=1616, Unknown=0, NotChecked=0, Total=1980 [2019-12-18 14:54:37,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34598 states. [2019-12-18 14:54:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34598 to 27108. [2019-12-18 14:54:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27108 states. [2019-12-18 14:54:37,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27108 states to 27108 states and 82247 transitions. [2019-12-18 14:54:37,654 INFO L78 Accepts]: Start accepts. Automaton has 27108 states and 82247 transitions. Word has length 67 [2019-12-18 14:54:37,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:37,655 INFO L462 AbstractCegarLoop]: Abstraction has 27108 states and 82247 transitions. [2019-12-18 14:54:37,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:54:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 27108 states and 82247 transitions. [2019-12-18 14:54:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:37,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:37,684 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:37,684 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:37,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:37,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1554321141, now seen corresponding path program 6 times [2019-12-18 14:54:37,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:37,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377495817] [2019-12-18 14:54:37,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:38,155 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 14:54:38,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377495817] [2019-12-18 14:54:38,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:38,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:54:38,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096178119] [2019-12-18 14:54:38,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:54:38,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:38,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:54:38,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:54:38,157 INFO L87 Difference]: Start difference. First operand 27108 states and 82247 transitions. Second operand 16 states. [2019-12-18 14:54:41,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:41,532 INFO L93 Difference]: Finished difference Result 38009 states and 113598 transitions. [2019-12-18 14:54:41,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 14:54:41,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 14:54:41,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:41,580 INFO L225 Difference]: With dead ends: 38009 [2019-12-18 14:54:41,580 INFO L226 Difference]: Without dead ends: 33733 [2019-12-18 14:54:41,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=404, Invalid=1948, Unknown=0, NotChecked=0, Total=2352 [2019-12-18 14:54:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33733 states. [2019-12-18 14:54:41,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33733 to 26299. [2019-12-18 14:54:41,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26299 states. [2019-12-18 14:54:42,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26299 states to 26299 states and 79780 transitions. [2019-12-18 14:54:42,032 INFO L78 Accepts]: Start accepts. Automaton has 26299 states and 79780 transitions. Word has length 67 [2019-12-18 14:54:42,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:42,032 INFO L462 AbstractCegarLoop]: Abstraction has 26299 states and 79780 transitions. [2019-12-18 14:54:42,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:54:42,032 INFO L276 IsEmpty]: Start isEmpty. Operand 26299 states and 79780 transitions. [2019-12-18 14:54:42,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:42,060 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:42,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:42,060 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:42,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:42,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1885964539, now seen corresponding path program 7 times [2019-12-18 14:54:42,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:42,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84848046] [2019-12-18 14:54:42,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:42,498 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 14:54:42,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84848046] [2019-12-18 14:54:42,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:42,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-18 14:54:42,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55523489] [2019-12-18 14:54:42,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-18 14:54:42,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:42,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-18 14:54:42,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-18 14:54:42,500 INFO L87 Difference]: Start difference. First operand 26299 states and 79780 transitions. Second operand 16 states. [2019-12-18 14:54:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:47,225 INFO L93 Difference]: Finished difference Result 49859 states and 150504 transitions. [2019-12-18 14:54:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-12-18 14:54:47,226 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-18 14:54:47,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:47,292 INFO L225 Difference]: With dead ends: 49859 [2019-12-18 14:54:47,292 INFO L226 Difference]: Without dead ends: 49092 [2019-12-18 14:54:47,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=536, Invalid=3004, Unknown=0, NotChecked=0, Total=3540 [2019-12-18 14:54:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49092 states. [2019-12-18 14:54:47,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49092 to 27179. [2019-12-18 14:54:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27179 states. [2019-12-18 14:54:47,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27179 states to 27179 states and 82293 transitions. [2019-12-18 14:54:47,847 INFO L78 Accepts]: Start accepts. Automaton has 27179 states and 82293 transitions. Word has length 67 [2019-12-18 14:54:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:47,848 INFO L462 AbstractCegarLoop]: Abstraction has 27179 states and 82293 transitions. [2019-12-18 14:54:47,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-18 14:54:47,848 INFO L276 IsEmpty]: Start isEmpty. Operand 27179 states and 82293 transitions. [2019-12-18 14:54:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:47,876 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:47,876 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:47,876 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:47,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:47,876 INFO L82 PathProgramCache]: Analyzing trace with hash 723261725, now seen corresponding path program 8 times [2019-12-18 14:54:47,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:47,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275408452] [2019-12-18 14:54:47,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:47,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:48,386 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 14:54:48,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275408452] [2019-12-18 14:54:48,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:48,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:54:48,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478532327] [2019-12-18 14:54:48,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:54:48,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:48,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:54:48,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:54:48,388 INFO L87 Difference]: Start difference. First operand 27179 states and 82293 transitions. Second operand 17 states. [2019-12-18 14:54:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:51,233 INFO L93 Difference]: Finished difference Result 35793 states and 106921 transitions. [2019-12-18 14:54:51,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-18 14:54:51,233 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 14:54:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:51,282 INFO L225 Difference]: With dead ends: 35793 [2019-12-18 14:54:51,282 INFO L226 Difference]: Without dead ends: 33510 [2019-12-18 14:54:51,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=350, Invalid=1456, Unknown=0, NotChecked=0, Total=1806 [2019-12-18 14:54:51,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33510 states. [2019-12-18 14:54:51,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33510 to 27125. [2019-12-18 14:54:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27125 states. [2019-12-18 14:54:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27125 states to 27125 states and 82024 transitions. [2019-12-18 14:54:51,704 INFO L78 Accepts]: Start accepts. Automaton has 27125 states and 82024 transitions. Word has length 67 [2019-12-18 14:54:51,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:51,705 INFO L462 AbstractCegarLoop]: Abstraction has 27125 states and 82024 transitions. [2019-12-18 14:54:51,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:54:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 27125 states and 82024 transitions. [2019-12-18 14:54:51,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:51,730 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:51,731 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:51,731 INFO L410 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:51,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:51,731 INFO L82 PathProgramCache]: Analyzing trace with hash 961817837, now seen corresponding path program 9 times [2019-12-18 14:54:51,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:51,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236446139] [2019-12-18 14:54:51,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:51,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:52,187 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 14:54:52,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236446139] [2019-12-18 14:54:52,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:52,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 14:54:52,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94837825] [2019-12-18 14:54:52,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 14:54:52,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:52,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 14:54:52,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-12-18 14:54:52,188 INFO L87 Difference]: Start difference. First operand 27125 states and 82024 transitions. Second operand 17 states. [2019-12-18 14:54:55,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:54:55,514 INFO L93 Difference]: Finished difference Result 35434 states and 105646 transitions. [2019-12-18 14:54:55,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-18 14:54:55,514 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 67 [2019-12-18 14:54:55,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:54:55,561 INFO L225 Difference]: With dead ends: 35434 [2019-12-18 14:54:55,561 INFO L226 Difference]: Without dead ends: 34461 [2019-12-18 14:54:55,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=369, Invalid=1701, Unknown=0, NotChecked=0, Total=2070 [2019-12-18 14:54:55,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34461 states. [2019-12-18 14:54:55,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34461 to 26971. [2019-12-18 14:54:55,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26971 states. [2019-12-18 14:54:56,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26971 states to 26971 states and 81625 transitions. [2019-12-18 14:54:56,010 INFO L78 Accepts]: Start accepts. Automaton has 26971 states and 81625 transitions. Word has length 67 [2019-12-18 14:54:56,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:54:56,010 INFO L462 AbstractCegarLoop]: Abstraction has 26971 states and 81625 transitions. [2019-12-18 14:54:56,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 14:54:56,010 INFO L276 IsEmpty]: Start isEmpty. Operand 26971 states and 81625 transitions. [2019-12-18 14:54:56,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:54:56,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:54:56,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:54:56,041 INFO L410 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:54:56,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:54:56,041 INFO L82 PathProgramCache]: Analyzing trace with hash -470687251, now seen corresponding path program 10 times [2019-12-18 14:54:56,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:54:56,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187575278] [2019-12-18 14:54:56,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:54:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:54:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:54:56,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187575278] [2019-12-18 14:54:56,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:54:56,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-18 14:54:56,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320661743] [2019-12-18 14:54:56,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-18 14:54:56,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:54:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-18 14:54:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-12-18 14:54:56,388 INFO L87 Difference]: Start difference. First operand 26971 states and 81625 transitions. Second operand 15 states. [2019-12-18 14:55:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:00,221 INFO L93 Difference]: Finished difference Result 48353 states and 145186 transitions. [2019-12-18 14:55:00,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-12-18 14:55:00,222 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-18 14:55:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:00,278 INFO L225 Difference]: With dead ends: 48353 [2019-12-18 14:55:00,278 INFO L226 Difference]: Without dead ends: 40866 [2019-12-18 14:55:00,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=526, Invalid=2444, Unknown=0, NotChecked=0, Total=2970 [2019-12-18 14:55:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40866 states. [2019-12-18 14:55:00,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40866 to 22754. [2019-12-18 14:55:00,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22754 states. [2019-12-18 14:55:00,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22754 states to 22754 states and 68970 transitions. [2019-12-18 14:55:00,746 INFO L78 Accepts]: Start accepts. Automaton has 22754 states and 68970 transitions. Word has length 67 [2019-12-18 14:55:00,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:00,746 INFO L462 AbstractCegarLoop]: Abstraction has 22754 states and 68970 transitions. [2019-12-18 14:55:00,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-18 14:55:00,746 INFO L276 IsEmpty]: Start isEmpty. Operand 22754 states and 68970 transitions. [2019-12-18 14:55:00,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:55:00,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:00,769 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:00,769 INFO L410 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:00,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:00,769 INFO L82 PathProgramCache]: Analyzing trace with hash -413434747, now seen corresponding path program 11 times [2019-12-18 14:55:00,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:00,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172450948] [2019-12-18 14:55:00,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:00,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:00,861 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 14:55:00,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172450948] [2019-12-18 14:55:00,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:00,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-18 14:55:00,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214564505] [2019-12-18 14:55:00,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 14:55:00,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 14:55:00,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:55:00,863 INFO L87 Difference]: Start difference. First operand 22754 states and 68970 transitions. Second operand 9 states. [2019-12-18 14:55:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:02,101 INFO L93 Difference]: Finished difference Result 36329 states and 109260 transitions. [2019-12-18 14:55:02,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 14:55:02,101 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2019-12-18 14:55:02,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:02,144 INFO L225 Difference]: With dead ends: 36329 [2019-12-18 14:55:02,144 INFO L226 Difference]: Without dead ends: 30194 [2019-12-18 14:55:02,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:55:02,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30194 states. [2019-12-18 14:55:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30194 to 22648. [2019-12-18 14:55:02,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22648 states. [2019-12-18 14:55:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22648 states to 22648 states and 68584 transitions. [2019-12-18 14:55:02,542 INFO L78 Accepts]: Start accepts. Automaton has 22648 states and 68584 transitions. Word has length 67 [2019-12-18 14:55:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:02,542 INFO L462 AbstractCegarLoop]: Abstraction has 22648 states and 68584 transitions. [2019-12-18 14:55:02,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 14:55:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 22648 states and 68584 transitions. [2019-12-18 14:55:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:55:02,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:02,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:02,567 INFO L410 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:02,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1770318001, now seen corresponding path program 12 times [2019-12-18 14:55:02,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:02,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165531025] [2019-12-18 14:55:02,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:02,952 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-12-18 14:55:03,036 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 14:55:03,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165531025] [2019-12-18 14:55:03,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:03,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:55:03,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031086484] [2019-12-18 14:55:03,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:55:03,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:03,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:55:03,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:55:03,038 INFO L87 Difference]: Start difference. First operand 22648 states and 68584 transitions. Second operand 11 states. [2019-12-18 14:55:04,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:04,073 INFO L93 Difference]: Finished difference Result 41052 states and 125127 transitions. [2019-12-18 14:55:04,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 14:55:04,073 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 14:55:04,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:04,131 INFO L225 Difference]: With dead ends: 41052 [2019-12-18 14:55:04,131 INFO L226 Difference]: Without dead ends: 39137 [2019-12-18 14:55:04,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-12-18 14:55:04,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39137 states. [2019-12-18 14:55:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39137 to 24890. [2019-12-18 14:55:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24890 states. [2019-12-18 14:55:04,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24890 states to 24890 states and 75658 transitions. [2019-12-18 14:55:04,615 INFO L78 Accepts]: Start accepts. Automaton has 24890 states and 75658 transitions. Word has length 67 [2019-12-18 14:55:04,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:04,615 INFO L462 AbstractCegarLoop]: Abstraction has 24890 states and 75658 transitions. [2019-12-18 14:55:04,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:55:04,615 INFO L276 IsEmpty]: Start isEmpty. Operand 24890 states and 75658 transitions. [2019-12-18 14:55:04,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:55:04,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:04,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:04,644 INFO L410 AbstractCegarLoop]: === Iteration 43 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:04,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:04,644 INFO L82 PathProgramCache]: Analyzing trace with hash 607615187, now seen corresponding path program 13 times [2019-12-18 14:55:04,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:04,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318390518] [2019-12-18 14:55:04,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:04,808 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 14:55:04,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318390518] [2019-12-18 14:55:04,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:04,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 14:55:04,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438756604] [2019-12-18 14:55:04,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 14:55:04,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:04,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 14:55:04,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:55:04,810 INFO L87 Difference]: Start difference. First operand 24890 states and 75658 transitions. Second operand 11 states. [2019-12-18 14:55:05,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:05,884 INFO L93 Difference]: Finished difference Result 39715 states and 120521 transitions. [2019-12-18 14:55:05,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 14:55:05,884 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-18 14:55:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:05,932 INFO L225 Difference]: With dead ends: 39715 [2019-12-18 14:55:05,933 INFO L226 Difference]: Without dead ends: 34519 [2019-12-18 14:55:05,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=438, Unknown=0, NotChecked=0, Total=552 [2019-12-18 14:55:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34519 states. [2019-12-18 14:55:06,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34519 to 21770. [2019-12-18 14:55:06,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21770 states. [2019-12-18 14:55:06,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21770 states to 21770 states and 66005 transitions. [2019-12-18 14:55:06,354 INFO L78 Accepts]: Start accepts. Automaton has 21770 states and 66005 transitions. Word has length 67 [2019-12-18 14:55:06,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:06,355 INFO L462 AbstractCegarLoop]: Abstraction has 21770 states and 66005 transitions. [2019-12-18 14:55:06,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 14:55:06,355 INFO L276 IsEmpty]: Start isEmpty. Operand 21770 states and 66005 transitions. [2019-12-18 14:55:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:55:06,376 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:06,376 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:06,377 INFO L410 AbstractCegarLoop]: === Iteration 44 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:06,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:06,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2101838907, now seen corresponding path program 14 times [2019-12-18 14:55:06,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:06,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909407990] [2019-12-18 14:55:06,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:55:06,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:55:06,489 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:55:06,489 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:55:06,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [894] [894] ULTIMATE.startENTRY-->L820: Formula: (let ((.cse0 (store |v_#valid_71| 0 0))) (and (= v_~z$w_buff0_used~0_958 0) (= v_~y~0_23 0) (= v_~z$r_buff0_thd2~0_111 0) (= v_~x~0_76 0) (= |v_#NULL.offset_6| 0) (= v_~z~0_178 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2281~0.base_26| 4) |v_#length_23|) (= 0 v_~__unbuffered_p2_EAX~0_45) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26|)) (= v_~z$w_buff1_used~0_531 0) (= v_~z$r_buff0_thd1~0_132 0) (= v_~z$r_buff1_thd1~0_108 0) (= |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~main$tmp_guard1~0_43 0) (= |v_#valid_69| (store .cse0 |v_ULTIMATE.start_main_~#t2281~0.base_26| 1)) (= v_~z$w_buff0~0_487 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~z$flush_delayed~0_28) (= v_~z$r_buff1_thd2~0_104 0) (= v_~z$mem_tmp~0_17 0) (= v_~z$w_buff1~0_307 0) (= 0 v_~z$r_buff1_thd3~0_237) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd0~0_141 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$read_delayed~0_7 0) (= 0 v_~weak$$choice0~0_16) (= 0 v_~__unbuffered_cnt~0_91) (= v_~weak$$choice2~0_111 0) (= 0 v_~z$r_buff0_thd3~0_332) (= v_~main$tmp_guard0~0_26 0) (= v_~__unbuffered_p2_EBX~0_57 0) (= v_~z$r_buff1_thd0~0_133 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2281~0.base_26|) |v_ULTIMATE.start_main_~#t2281~0.offset_19| 0)) |v_#memory_int_21|) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2281~0.base_26|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_71|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_104, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_31|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_287|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_16|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_41|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_93|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_141, ULTIMATE.start_main_~#t2281~0.offset=|v_ULTIMATE.start_main_~#t2281~0.offset_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_45, ~z$mem_tmp~0=v_~z$mem_tmp~0_17, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_57, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_531, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_12|, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_23|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_108, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_332, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_19|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91, ~x~0=v_~x~0_76, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_307, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_43, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_35|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_35|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_133, ULTIMATE.start_main_~#t2281~0.base=|v_ULTIMATE.start_main_~#t2281~0.base_26|, ~y~0=v_~y~0_23, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_111, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_958, ~z$w_buff0~0=v_~z$w_buff0~0_487, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_237, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_69|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_178, ~weak$$choice2~0=v_~weak$$choice2~0_111, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ~z$read_delayed~0, #NULL.offset, ~z$w_buff1~0, ULTIMATE.start_main_#t~ite49, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t2283~0.base, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2281~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2281~0.base, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ULTIMATE.start_main_~#t2283~0.offset, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#res, ~z$r_buff1_thd1~0, #valid, #memory_int, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_~#t2282~0.offset, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-18 14:55:06,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L820-1-->L822: Formula: (and (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2282~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2282~0.base_9| 4)) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2282~0.base_9|) |v_ULTIMATE.start_main_~#t2282~0.offset_8| 1))) (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t2282~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t2282~0.offset_8|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2282~0.base=|v_ULTIMATE.start_main_~#t2282~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_3|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t2282~0.offset=|v_ULTIMATE.start_main_~#t2282~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2282~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t2282~0.offset, #length] because there is no mapped edge [2019-12-18 14:55:06,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] P0ENTRY-->L4-3: Formula: (and (= ~z$w_buff0_used~0_Out1922931583 1) (= |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1922931583| P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1922931583) (= ~z$w_buff1~0_Out1922931583 ~z$w_buff0~0_In1922931583) (= 1 |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1922931583|) (= ~z$w_buff1_used~0_Out1922931583 ~z$w_buff0_used~0_In1922931583) (= |P0Thread1of1ForFork0_#in~arg.base_In1922931583| P0Thread1of1ForFork0_~arg.base_Out1922931583) (= P0Thread1of1ForFork0_~arg.offset_Out1922931583 |P0Thread1of1ForFork0_#in~arg.offset_In1922931583|) (= ~z$w_buff0~0_Out1922931583 1) (= (mod ~z$w_buff1_used~0_Out1922931583 256) 0)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1922931583|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1922931583, ~z$w_buff0~0=~z$w_buff0~0_In1922931583, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1922931583|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|P0Thread1of1ForFork0_#in~arg.offset_In1922931583|, ~z$w_buff0_used~0=~z$w_buff0_used~0_Out1922931583, ~z$w_buff0~0=~z$w_buff0~0_Out1922931583, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1922931583, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_Out1922931583, P0Thread1of1ForFork0_#in~arg.base=|P0Thread1of1ForFork0_#in~arg.base_In1922931583|, ~z$w_buff1~0=~z$w_buff1~0_Out1922931583, P0Thread1of1ForFork0_~arg.base=P0Thread1of1ForFork0_~arg.base_Out1922931583, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_Out1922931583|, P0Thread1of1ForFork0_~arg.offset=P0Thread1of1ForFork0_~arg.offset_Out1922931583} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 14:55:06,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t2283~0.offset_9|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2283~0.base_11|) |v_ULTIMATE.start_main_~#t2283~0.offset_9| 2)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t2283~0.base_11| 0)) (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11| 1) |v_#valid_40|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2283~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t2283~0.base_11| 4) |v_#length_17|) (= 0 (select |v_#valid_41| |v_ULTIMATE.start_main_~#t2283~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t2283~0.offset=|v_ULTIMATE.start_main_~#t2283~0.offset_9|, #length=|v_#length_17|, ULTIMATE.start_main_~#t2283~0.base=|v_ULTIMATE.start_main_~#t2283~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, ULTIMATE.start_main_~#t2283~0.offset, #length, ULTIMATE.start_main_~#t2283~0.base] because there is no mapped edge [2019-12-18 14:55:06,497 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [817] [817] L764-2-->L764-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork1_#t~ite9_Out-390281085| |P1Thread1of1ForFork1_#t~ite10_Out-390281085|)) (.cse2 (= (mod ~z$w_buff1_used~0_In-390281085 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-390281085 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite9_Out-390281085| ~z$w_buff1~0_In-390281085) .cse1 (not .cse2)) (and (= |P1Thread1of1ForFork1_#t~ite9_Out-390281085| ~z~0_In-390281085) .cse1 (or .cse2 .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, ~z$w_buff1~0=~z$w_buff1~0_In-390281085, ~z~0=~z~0_In-390281085} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out-390281085|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-390281085, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-390281085, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out-390281085|, ~z$w_buff1~0=~z$w_buff1~0_In-390281085, ~z~0=~z~0_In-390281085} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 14:55:06,499 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L765-->L765-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In463455882 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In463455882 256) 0))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out463455882| 0)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out463455882| ~z$w_buff0_used~0_In463455882)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In463455882, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In463455882} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In463455882, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out463455882|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In463455882} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:55:06,501 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L766-->L766-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In2093005893 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In2093005893 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In2093005893 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In2093005893 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite12_Out2093005893| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In2093005893 |P1Thread1of1ForFork1_#t~ite12_Out2093005893|) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2093005893, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2093005893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2093005893, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2093005893} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2093005893, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2093005893, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2093005893, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out2093005893|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2093005893} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:55:06,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1490484813 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1490484813 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1490484813 |P1Thread1of1ForFork1_#t~ite13_Out1490484813|)) (and (= |P1Thread1of1ForFork1_#t~ite13_Out1490484813| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1490484813, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1490484813} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1490484813, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out1490484813|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1490484813} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 14:55:06,502 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L787-->L787-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In269642891 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite23_Out269642891| |P2Thread1of1ForFork2_#t~ite24_Out269642891|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In269642891 256)))) (or (and .cse0 (= (mod ~z$r_buff1_thd3~0_In269642891 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In269642891 256)) (and .cse0 (= (mod ~z$w_buff1_used~0_In269642891 256) 0)))) .cse1 (= |P2Thread1of1ForFork2_#t~ite23_Out269642891| ~z$w_buff1~0_In269642891)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite23_In269642891| |P2Thread1of1ForFork2_#t~ite23_Out269642891|) (= ~z$w_buff1~0_In269642891 |P2Thread1of1ForFork2_#t~ite24_Out269642891|)))) InVars {P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_In269642891|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269642891, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In269642891, ~z$w_buff1_used~0=~z$w_buff1_used~0_In269642891, ~z$w_buff1~0=~z$w_buff1~0_In269642891, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In269642891, ~weak$$choice2~0=~weak$$choice2~0_In269642891} OutVars{P2Thread1of1ForFork2_#t~ite23=|P2Thread1of1ForFork2_#t~ite23_Out269642891|, P2Thread1of1ForFork2_#t~ite24=|P2Thread1of1ForFork2_#t~ite24_Out269642891|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In269642891, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In269642891, ~z$w_buff1_used~0=~z$w_buff1_used~0_In269642891, ~z$w_buff1~0=~z$w_buff1~0_In269642891, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In269642891, ~weak$$choice2~0=~weak$$choice2~0_In269642891} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite23, P2Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-18 14:55:06,503 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L788-->L788-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1683184130 256)))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1683184130 256)))) (or (= (mod ~z$w_buff0_used~0_In-1683184130 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1683184130 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1683184130 256) 0)))) (= |P2Thread1of1ForFork2_#t~ite27_Out-1683184130| |P2Thread1of1ForFork2_#t~ite26_Out-1683184130|) (= ~z$w_buff0_used~0_In-1683184130 |P2Thread1of1ForFork2_#t~ite26_Out-1683184130|)) (and (= |P2Thread1of1ForFork2_#t~ite26_In-1683184130| |P2Thread1of1ForFork2_#t~ite26_Out-1683184130|) (not .cse0) (= |P2Thread1of1ForFork2_#t~ite27_Out-1683184130| ~z$w_buff0_used~0_In-1683184130)))) InVars {P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_In-1683184130|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683184130, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1683184130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683184130, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1683184130, ~weak$$choice2~0=~weak$$choice2~0_In-1683184130} OutVars{P2Thread1of1ForFork2_#t~ite26=|P2Thread1of1ForFork2_#t~ite26_Out-1683184130|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1683184130, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1683184130, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1683184130, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1683184130, ~weak$$choice2~0=~weak$$choice2~0_In-1683184130, P2Thread1of1ForFork2_#t~ite27=|P2Thread1of1ForFork2_#t~ite27_Out-1683184130|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite26, P2Thread1of1ForFork2_#t~ite27] because there is no mapped edge [2019-12-18 14:55:06,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In418124095 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In418124095 256))) (.cse1 (= (mod ~z$r_buff0_thd2~0_In418124095 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In418124095 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite14_Out418124095|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite14_Out418124095| ~z$r_buff1_thd2~0_In418124095) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In418124095, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In418124095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In418124095, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In418124095} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In418124095, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In418124095, ~z$w_buff1_used~0=~z$w_buff1_used~0_In418124095, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out418124095|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In418124095} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:55:06,504 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L768-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_28| v_~z$r_buff1_thd2~0_55) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_40 1) v_~__unbuffered_cnt~0_39)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_28|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_55, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_27|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:55:06,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L789-->L789-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In190521429 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite29_In190521429| |P2Thread1of1ForFork2_#t~ite29_Out190521429|) (not .cse0) (= ~z$w_buff1_used~0_In190521429 |P2Thread1of1ForFork2_#t~ite30_Out190521429|)) (and (= |P2Thread1of1ForFork2_#t~ite29_Out190521429| |P2Thread1of1ForFork2_#t~ite30_Out190521429|) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In190521429 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In190521429 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In190521429 256) 0)) (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In190521429 256))))) (= |P2Thread1of1ForFork2_#t~ite29_Out190521429| ~z$w_buff1_used~0_In190521429)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In190521429, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In190521429, ~z$w_buff1_used~0=~z$w_buff1_used~0_In190521429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In190521429, ~weak$$choice2~0=~weak$$choice2~0_In190521429, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_In190521429|} OutVars{P2Thread1of1ForFork2_#t~ite30=|P2Thread1of1ForFork2_#t~ite30_Out190521429|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In190521429, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In190521429, ~z$w_buff1_used~0=~z$w_buff1_used~0_In190521429, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In190521429, ~weak$$choice2~0=~weak$$choice2~0_In190521429, P2Thread1of1ForFork2_#t~ite29=|P2Thread1of1ForFork2_#t~ite29_Out190521429|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite30, P2Thread1of1ForFork2_#t~ite29] because there is no mapped edge [2019-12-18 14:55:06,505 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L790-->L791: Formula: (and (= v_~z$r_buff0_thd3~0_68 v_~z$r_buff0_thd3~0_67) (not (= 0 (mod v_~weak$$choice2~0_15 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{P2Thread1of1ForFork2_#t~ite31=|v_P2Thread1of1ForFork2_#t~ite31_8|, P2Thread1of1ForFork2_#t~ite33=|v_P2Thread1of1ForFork2_#t~ite33_9|, P2Thread1of1ForFork2_#t~ite32=|v_P2Thread1of1ForFork2_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite31, P2Thread1of1ForFork2_#t~ite33, P2Thread1of1ForFork2_#t~ite32, ~z$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 14:55:06,506 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L793-->L797: Formula: (and (= 0 v_~z$flush_delayed~0_6) (= v_~z~0_25 v_~z$mem_tmp~0_5) (not (= 0 (mod v_~z$flush_delayed~0_7 256)))) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_5, P2Thread1of1ForFork2_#t~ite37=|v_P2Thread1of1ForFork2_#t~ite37_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_6, ~z~0=v_~z~0_25} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-18 14:55:06,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L745-->L745-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1405351385 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1405351385 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1405351385 |P0Thread1of1ForFork0_#t~ite5_Out-1405351385|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1405351385|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405351385, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1405351385} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1405351385|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405351385, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1405351385} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:55:06,508 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] L746-->L746-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd1~0_In-136663262 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-136663262 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-136663262 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd1~0_In-136663262 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-136663262 |P0Thread1of1ForFork0_#t~ite6_Out-136663262|)) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-136663262| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-136663262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136663262, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-136663262} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-136663262|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-136663262, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-136663262, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-136663262, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-136663262} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:55:06,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L747-->L748: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In2015616347 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In2015616347 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_Out2015616347 ~z$r_buff0_thd1~0_In2015616347)) (and (= ~z$r_buff0_thd1~0_Out2015616347 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2015616347, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In2015616347} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2015616347, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2015616347|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out2015616347} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:55:06,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L748-->L748-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-211993523 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In-211993523 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-211993523 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-211993523 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd1~0_In-211993523 |P0Thread1of1ForFork0_#t~ite8_Out-211993523|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-211993523|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-211993523, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-211993523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211993523, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-211993523} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-211993523, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-211993523|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-211993523, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-211993523, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-211993523} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:55:06,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [861] [861] L748-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_73 (+ v_~__unbuffered_cnt~0_74 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~z$r_buff1_thd1~0_68 |v_P0Thread1of1ForFork0_#t~ite8_44|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_43|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_68, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_73} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 14:55:06,509 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L797-2-->L797-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-1259775689 256) 0)) (.cse0 (= |P2Thread1of1ForFork2_#t~ite39_Out-1259775689| |P2Thread1of1ForFork2_#t~ite38_Out-1259775689|)) (.cse2 (= (mod ~z$r_buff1_thd3~0_In-1259775689 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite38_Out-1259775689| ~z~0_In-1259775689) .cse0 (or .cse1 .cse2)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite38_Out-1259775689| ~z$w_buff1~0_In-1259775689) .cse0 (not .cse2)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1259775689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1259775689, ~z$w_buff1~0=~z$w_buff1~0_In-1259775689, ~z~0=~z~0_In-1259775689} OutVars{~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1259775689, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1259775689, ~z$w_buff1~0=~z$w_buff1~0_In-1259775689, ~z~0=~z~0_In-1259775689, P2Thread1of1ForFork2_#t~ite39=|P2Thread1of1ForFork2_#t~ite39_Out-1259775689|, P2Thread1of1ForFork2_#t~ite38=|P2Thread1of1ForFork2_#t~ite38_Out-1259775689|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite39, P2Thread1of1ForFork2_#t~ite38] because there is no mapped edge [2019-12-18 14:55:06,510 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1478670153 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1478670153 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1478670153 |P2Thread1of1ForFork2_#t~ite40_Out1478670153|)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite40_Out1478670153|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1478670153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1478670153} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1478670153, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1478670153, P2Thread1of1ForFork2_#t~ite40=|P2Thread1of1ForFork2_#t~ite40_Out1478670153|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite40] because there is no mapped edge [2019-12-18 14:55:06,511 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [819] [819] L799-->L799-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In715742688 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In715742688 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In715742688 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd3~0_In715742688 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite41_Out715742688| ~z$w_buff1_used~0_In715742688) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite41_Out715742688| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In715742688, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In715742688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In715742688, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In715742688} OutVars{P2Thread1of1ForFork2_#t~ite41=|P2Thread1of1ForFork2_#t~ite41_Out715742688|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In715742688, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In715742688, ~z$w_buff1_used~0=~z$w_buff1_used~0_In715742688, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In715742688} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite41] because there is no mapped edge [2019-12-18 14:55:06,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [815] [815] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-175367507 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-175367507 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite42_Out-175367507| 0) (not .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite42_Out-175367507| ~z$r_buff0_thd3~0_In-175367507) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-175367507, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-175367507} OutVars{P2Thread1of1ForFork2_#t~ite42=|P2Thread1of1ForFork2_#t~ite42_Out-175367507|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-175367507, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-175367507} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite42] because there is no mapped edge [2019-12-18 14:55:06,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L801-->L801-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd3~0_In-1801566204 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1801566204 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In-1801566204 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1801566204 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-1801566204 |P2Thread1of1ForFork2_#t~ite43_Out-1801566204|)) (and (= 0 |P2Thread1of1ForFork2_#t~ite43_Out-1801566204|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1801566204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1801566204, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1801566204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1801566204} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1801566204, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1801566204, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out-1801566204|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1801566204, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1801566204} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-18 14:55:06,512 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L801-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_136 |v_P2Thread1of1ForFork2_#t~ite43_30|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55)) InVars {P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_136, P2Thread1of1ForFork2_#t~ite43=|v_P2Thread1of1ForFork2_#t~ite43_29|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite43, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:55:06,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L824-1-->L830: Formula: (and (= v_~main$tmp_guard0~0_7 1) (= 3 v_~__unbuffered_cnt~0_13)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:55:06,513 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L830-2-->L830-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1227626347| |ULTIMATE.start_main_#t~ite47_Out-1227626347|)) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1227626347 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1227626347 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-1227626347 |ULTIMATE.start_main_#t~ite47_Out-1227626347|) .cse2) (and (= ~z$w_buff1~0_In-1227626347 |ULTIMATE.start_main_#t~ite47_Out-1227626347|) .cse2 (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1227626347, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1227626347, ~z$w_buff1~0=~z$w_buff1~0_In-1227626347, ~z~0=~z~0_In-1227626347} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1227626347, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1227626347|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1227626347, ~z$w_buff1~0=~z$w_buff1~0_In-1227626347, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1227626347|, ~z~0=~z~0_In-1227626347} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:55:06,514 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L831-->L831-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-11998536 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-11998536 256)))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out-11998536| 0) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-11998536 |ULTIMATE.start_main_#t~ite49_Out-11998536|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-11998536, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-11998536} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-11998536, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-11998536, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-11998536|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-18 14:55:06,515 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In-1731254031 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1731254031 256) 0)) (.cse3 (= (mod ~z$w_buff0_used~0_In-1731254031 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1731254031 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-1731254031| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |ULTIMATE.start_main_#t~ite50_Out-1731254031| ~z$w_buff1_used~0_In-1731254031)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1731254031, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1731254031, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1731254031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1731254031} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1731254031|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1731254031, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1731254031, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1731254031, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1731254031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-18 14:55:06,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1787161380 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1787161380 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1787161380 |ULTIMATE.start_main_#t~ite51_Out1787161380|)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out1787161380| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1787161380, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1787161380} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1787161380, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1787161380|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1787161380} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-18 14:55:06,516 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In772226965 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In772226965 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In772226965 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In772226965 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In772226965 |ULTIMATE.start_main_#t~ite52_Out772226965|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite52_Out772226965| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In772226965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In772226965, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In772226965, ~z$w_buff1_used~0=~z$w_buff1_used~0_In772226965} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out772226965|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In772226965, ~z$w_buff0_used~0=~z$w_buff0_used~0_In772226965, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In772226965, ~z$w_buff1_used~0=~z$w_buff1_used~0_In772226965} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-18 14:55:06,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L834-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_23 256)) (= |v_ULTIMATE.start_main_#t~ite52_54| v_~z$r_buff1_thd0~0_96) (= v_~x~0_49 2) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_~main$tmp_guard1~0_23 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= 1 v_~__unbuffered_p2_EAX~0_25)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_54|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_53|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_96, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_25, ~x~0=v_~x~0_49, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:55:06,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:55:06 BasicIcfg [2019-12-18 14:55:06,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:55:06,628 INFO L168 Benchmark]: Toolchain (without parser) took 153857.71 ms. Allocated memory was 144.2 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 101.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 7.1 GB. [2019-12-18 14:55:06,629 INFO L168 Benchmark]: CDTParser took 0.47 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-18 14:55:06,629 INFO L168 Benchmark]: CACSL2BoogieTranslator took 826.44 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 154.4 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:06,629 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.38 ms. Allocated memory is still 200.8 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:06,630 INFO L168 Benchmark]: Boogie Preprocessor took 40.60 ms. Allocated memory is still 200.8 MB. Free memory was 151.7 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:06,630 INFO L168 Benchmark]: RCFGBuilder took 919.44 ms. Allocated memory is still 200.8 MB. Free memory was 148.9 MB in the beginning and 99.1 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:06,630 INFO L168 Benchmark]: TraceAbstraction took 152006.21 ms. Allocated memory was 200.8 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2019-12-18 14:55:06,632 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.47 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 826.44 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 100.6 MB in the beginning and 154.4 MB in the end (delta: -53.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.38 ms. Allocated memory is still 200.8 MB. Free memory was 153.7 MB in the beginning and 151.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.60 ms. Allocated memory is still 200.8 MB. Free memory was 151.7 MB in the beginning and 148.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 919.44 ms. Allocated memory is still 200.8 MB. Free memory was 148.9 MB in the beginning and 99.1 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 152006.21 ms. Allocated memory was 200.8 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 98.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 175 ProgramPointsBefore, 92 ProgramPointsAfterwards, 212 TransitionsBefore, 102 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 32 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 31 ChoiceCompositions, 7185 VarBasedMoverChecksPositive, 382 VarBasedMoverChecksNegative, 188 SemBasedMoverChecksPositive, 288 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 125946 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L820] FCALL, FORK 0 pthread_create(&t2281, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L734] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L735] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L736] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L737] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK 0 pthread_create(&t2282, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t2283, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L758] 2 x = 2 [L761] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 3 __unbuffered_p2_EAX = y [L781] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L782] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L783] 3 z$flush_delayed = weak$$choice2 [L784] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L765] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L786] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L787] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L767] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L789] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L792] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L745] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L746] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L797] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L798] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L799] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L800] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L831] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L832] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L833] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 166 locations, 2 error locations. Result: UNSAFE, OverallTime: 151.6s, OverallIterations: 44, TraceHistogramMax: 1, AutomataDifference: 73.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 11334 SDtfs, 16725 SDslu, 48045 SDs, 0 SdLazy, 43698 SolverSat, 1015 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 910 GetRequests, 64 SyntacticMatches, 56 SemanticMatches, 790 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8331 ImplicationChecksByTransitivity, 14.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142946occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 44.2s AutomataMinimizationTime, 43 MinimizatonAttempts, 446980 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 2382 NumberOfCodeBlocks, 2382 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 2272 ConstructedInterpolants, 0 QuantifiedInterpolants, 650702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...