/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:24:19,503 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:24:19,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:24:19,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:24:19,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:24:19,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:24:19,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:24:19,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:24:19,534 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:24:19,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:24:19,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:24:19,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:24:19,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:24:19,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:24:19,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:24:19,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:24:19,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:24:19,543 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:24:19,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:24:19,549 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:24:19,554 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:24:19,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:24:19,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:24:19,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:24:19,562 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:24:19,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:24:19,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:24:19,565 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:24:19,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:24:19,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:24:19,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:24:19,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:24:19,571 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:24:19,572 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:24:19,573 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:24:19,573 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:24:19,574 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:24:19,574 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:24:19,574 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:24:19,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:24:19,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:24:19,583 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 03:24:19,600 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:24:19,600 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:24:19,601 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:24:19,601 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:24:19,602 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:24:19,602 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:24:19,602 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:24:19,602 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:24:19,603 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:24:19,603 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:24:19,603 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:24:19,603 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:24:19,603 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:24:19,604 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:24:19,604 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:24:19,604 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:24:19,604 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:24:19,605 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:24:19,605 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:24:19,605 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:24:19,605 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:24:19,605 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:24:19,606 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:24:19,606 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:24:19,606 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:24:19,606 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:24:19,607 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:24:19,607 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:24:19,607 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:24:19,607 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:24:19,939 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:24:19,959 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:24:19,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:24:19,965 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:24:19,965 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:24:19,966 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-19 03:24:20,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526c9d48a/22c89013cbc5482d900fa571b63f15f4/FLAGcd9448816 [2019-12-19 03:24:20,602 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:24:20,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_tso.oepc.i [2019-12-19 03:24:20,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526c9d48a/22c89013cbc5482d900fa571b63f15f4/FLAGcd9448816 [2019-12-19 03:24:20,861 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/526c9d48a/22c89013cbc5482d900fa571b63f15f4 [2019-12-19 03:24:20,872 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:24:20,874 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:24:20,875 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:24:20,875 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:24:20,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:24:20,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:24:20" (1/1) ... [2019-12-19 03:24:20,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:20, skipping insertion in model container [2019-12-19 03:24:20,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:24:20" (1/1) ... [2019-12-19 03:24:20,891 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:24:20,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:24:21,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:24:21,556 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:24:21,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:24:21,720 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:24:21,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21 WrapperNode [2019-12-19 03:24:21,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:24:21,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:24:21,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:24:21,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:24:21,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,752 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,793 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:24:21,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:24:21,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:24:21,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:24:21,803 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,826 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (1/1) ... [2019-12-19 03:24:21,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:24:21,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:24:21,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:24:21,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:24:21,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (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-19 03:24:21,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:24:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:24:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:24:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:24:21,900 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:24:21,900 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:24:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:24:21,901 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:24:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:24:21,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:24:21,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:24:21,903 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:24:22,593 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:24:22,593 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:24:22,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:24:22 BoogieIcfgContainer [2019-12-19 03:24:22,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:24:22,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:24:22,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:24:22,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:24:22,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:24:20" (1/3) ... [2019-12-19 03:24:22,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52be31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:24:22, skipping insertion in model container [2019-12-19 03:24:22,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:21" (2/3) ... [2019-12-19 03:24:22,602 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52be31a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:24:22, skipping insertion in model container [2019-12-19 03:24:22,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:24:22" (3/3) ... [2019-12-19 03:24:22,604 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_tso.oepc.i [2019-12-19 03:24:22,615 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:24:22,615 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:24:22,623 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:24:22,625 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:24:22,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,671 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,672 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,672 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,673 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,674 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,680 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,681 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,682 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,683 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,696 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,697 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,700 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,701 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:22,719 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:24:22,757 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:24:22,757 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:24:22,758 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:24:22,758 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:24:22,758 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:24:22,758 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:24:22,758 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:24:22,758 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:24:22,773 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-19 03:24:24,172 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22494 states. [2019-12-19 03:24:24,175 INFO L276 IsEmpty]: Start isEmpty. Operand 22494 states. [2019-12-19 03:24:24,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-19 03:24:24,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:24,187 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] [2019-12-19 03:24:24,188 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:24,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:24,195 INFO L82 PathProgramCache]: Analyzing trace with hash 718983594, now seen corresponding path program 1 times [2019-12-19 03:24:24,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:24,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522905404] [2019-12-19 03:24:24,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:24,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:24,539 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-19 03:24:24,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522905404] [2019-12-19 03:24:24,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:24,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:24:24,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416943432] [2019-12-19 03:24:24,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:24:24,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:24,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:24:24,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:24,570 INFO L87 Difference]: Start difference. First operand 22494 states. Second operand 4 states. [2019-12-19 03:24:25,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:25,114 INFO L93 Difference]: Finished difference Result 23446 states and 91747 transitions. [2019-12-19 03:24:25,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:24:25,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-19 03:24:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:25,342 INFO L225 Difference]: With dead ends: 23446 [2019-12-19 03:24:25,342 INFO L226 Difference]: Without dead ends: 21270 [2019-12-19 03:24:25,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21270 states. [2019-12-19 03:24:27,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21270 to 21270. [2019-12-19 03:24:27,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21270 states. [2019-12-19 03:24:27,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21270 states to 21270 states and 83771 transitions. [2019-12-19 03:24:27,427 INFO L78 Accepts]: Start accepts. Automaton has 21270 states and 83771 transitions. Word has length 37 [2019-12-19 03:24:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:27,428 INFO L462 AbstractCegarLoop]: Abstraction has 21270 states and 83771 transitions. [2019-12-19 03:24:27,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:24:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 21270 states and 83771 transitions. [2019-12-19 03:24:27,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 03:24:27,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:27,442 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] [2019-12-19 03:24:27,442 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:27,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:27,443 INFO L82 PathProgramCache]: Analyzing trace with hash -580973517, now seen corresponding path program 1 times [2019-12-19 03:24:27,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:27,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077341031] [2019-12-19 03:24:27,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:27,605 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-19 03:24:27,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077341031] [2019-12-19 03:24:27,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:27,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:27,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851731126] [2019-12-19 03:24:27,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:27,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:27,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:27,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:27,609 INFO L87 Difference]: Start difference. First operand 21270 states and 83771 transitions. Second operand 5 states. [2019-12-19 03:24:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:28,754 INFO L93 Difference]: Finished difference Result 34704 states and 129063 transitions. [2019-12-19 03:24:28,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:28,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 03:24:28,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:28,913 INFO L225 Difference]: With dead ends: 34704 [2019-12-19 03:24:28,913 INFO L226 Difference]: Without dead ends: 34560 [2019-12-19 03:24:28,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34560 states. [2019-12-19 03:24:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34560 to 33060. [2019-12-19 03:24:30,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33060 states. [2019-12-19 03:24:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33060 states to 33060 states and 123951 transitions. [2019-12-19 03:24:31,267 INFO L78 Accepts]: Start accepts. Automaton has 33060 states and 123951 transitions. Word has length 44 [2019-12-19 03:24:31,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:31,268 INFO L462 AbstractCegarLoop]: Abstraction has 33060 states and 123951 transitions. [2019-12-19 03:24:31,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 33060 states and 123951 transitions. [2019-12-19 03:24:31,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 03:24:31,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:31,274 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] [2019-12-19 03:24:31,275 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1894481532, now seen corresponding path program 1 times [2019-12-19 03:24:31,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:31,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595410079] [2019-12-19 03:24:31,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:31,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:31,385 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-19 03:24:31,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595410079] [2019-12-19 03:24:31,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:31,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:31,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193590763] [2019-12-19 03:24:31,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:31,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:31,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:31,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:31,389 INFO L87 Difference]: Start difference. First operand 33060 states and 123951 transitions. Second operand 5 states. [2019-12-19 03:24:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:31,990 INFO L93 Difference]: Finished difference Result 40212 states and 148620 transitions. [2019-12-19 03:24:31,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:31,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 03:24:31,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:32,128 INFO L225 Difference]: With dead ends: 40212 [2019-12-19 03:24:32,128 INFO L226 Difference]: Without dead ends: 40052 [2019-12-19 03:24:32,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40052 states. [2019-12-19 03:24:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40052 to 34633. [2019-12-19 03:24:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34633 states. [2019-12-19 03:24:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34633 states to 34633 states and 129247 transitions. [2019-12-19 03:24:34,693 INFO L78 Accepts]: Start accepts. Automaton has 34633 states and 129247 transitions. Word has length 45 [2019-12-19 03:24:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:34,693 INFO L462 AbstractCegarLoop]: Abstraction has 34633 states and 129247 transitions. [2019-12-19 03:24:34,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:34,694 INFO L276 IsEmpty]: Start isEmpty. Operand 34633 states and 129247 transitions. [2019-12-19 03:24:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:24:34,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:34,942 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:34,942 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:34,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1517466393, now seen corresponding path program 1 times [2019-12-19 03:24:34,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:34,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072050403] [2019-12-19 03:24:34,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:35,060 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-19 03:24:35,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072050403] [2019-12-19 03:24:35,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:35,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:24:35,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800093341] [2019-12-19 03:24:35,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:24:35,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:35,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:24:35,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:24:35,063 INFO L87 Difference]: Start difference. First operand 34633 states and 129247 transitions. Second operand 6 states. [2019-12-19 03:24:35,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:35,993 INFO L93 Difference]: Finished difference Result 45661 states and 166141 transitions. [2019-12-19 03:24:35,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:24:35,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 03:24:35,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:36,123 INFO L225 Difference]: With dead ends: 45661 [2019-12-19 03:24:36,124 INFO L226 Difference]: Without dead ends: 45517 [2019-12-19 03:24:36,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 03:24:36,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45517 states. [2019-12-19 03:24:38,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45517 to 33596. [2019-12-19 03:24:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33596 states. [2019-12-19 03:24:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33596 states to 33596 states and 125402 transitions. [2019-12-19 03:24:38,574 INFO L78 Accepts]: Start accepts. Automaton has 33596 states and 125402 transitions. Word has length 52 [2019-12-19 03:24:38,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:38,575 INFO L462 AbstractCegarLoop]: Abstraction has 33596 states and 125402 transitions. [2019-12-19 03:24:38,575 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:24:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 33596 states and 125402 transitions. [2019-12-19 03:24:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-19 03:24:38,608 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:38,609 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:38,609 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:38,609 INFO L82 PathProgramCache]: Analyzing trace with hash 588960950, now seen corresponding path program 1 times [2019-12-19 03:24:38,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:38,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024125290] [2019-12-19 03:24:38,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:38,720 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-19 03:24:38,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024125290] [2019-12-19 03:24:38,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:38,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:24:38,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840425052] [2019-12-19 03:24:38,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:24:38,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:38,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:24:38,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:24:38,724 INFO L87 Difference]: Start difference. First operand 33596 states and 125402 transitions. Second operand 6 states. [2019-12-19 03:24:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:39,671 INFO L93 Difference]: Finished difference Result 46068 states and 167835 transitions. [2019-12-19 03:24:39,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:24:39,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-19 03:24:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:39,767 INFO L225 Difference]: With dead ends: 46068 [2019-12-19 03:24:39,768 INFO L226 Difference]: Without dead ends: 45828 [2019-12-19 03:24:39,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:24:39,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45828 states. [2019-12-19 03:24:42,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45828 to 39957. [2019-12-19 03:24:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39957 states. [2019-12-19 03:24:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39957 states to 39957 states and 147326 transitions. [2019-12-19 03:24:42,346 INFO L78 Accepts]: Start accepts. Automaton has 39957 states and 147326 transitions. Word has length 59 [2019-12-19 03:24:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:42,347 INFO L462 AbstractCegarLoop]: Abstraction has 39957 states and 147326 transitions. [2019-12-19 03:24:42,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:24:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 39957 states and 147326 transitions. [2019-12-19 03:24:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 03:24:42,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:42,378 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] [2019-12-19 03:24:42,379 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:42,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:42,379 INFO L82 PathProgramCache]: Analyzing trace with hash 801616715, now seen corresponding path program 1 times [2019-12-19 03:24:42,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:42,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949668192] [2019-12-19 03:24:42,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:42,439 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-19 03:24:42,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949668192] [2019-12-19 03:24:42,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:42,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:24:42,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787076577] [2019-12-19 03:24:42,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:24:42,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:42,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:24:42,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:24:42,441 INFO L87 Difference]: Start difference. First operand 39957 states and 147326 transitions. Second operand 3 states. [2019-12-19 03:24:42,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:42,682 INFO L93 Difference]: Finished difference Result 50255 states and 182161 transitions. [2019-12-19 03:24:42,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:24:42,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-19 03:24:42,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:42,784 INFO L225 Difference]: With dead ends: 50255 [2019-12-19 03:24:42,784 INFO L226 Difference]: Without dead ends: 50255 [2019-12-19 03:24:42,784 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-19 03:24:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50255 states. [2019-12-19 03:24:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50255 to 43887. [2019-12-19 03:24:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43887 states. [2019-12-19 03:24:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43887 states to 43887 states and 160764 transitions. [2019-12-19 03:24:43,893 INFO L78 Accepts]: Start accepts. Automaton has 43887 states and 160764 transitions. Word has length 61 [2019-12-19 03:24:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:43,894 INFO L462 AbstractCegarLoop]: Abstraction has 43887 states and 160764 transitions. [2019-12-19 03:24:43,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:24:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 43887 states and 160764 transitions. [2019-12-19 03:24:43,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 03:24:43,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:43,929 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-19 03:24:43,929 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:43,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:43,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1777012394, now seen corresponding path program 1 times [2019-12-19 03:24:43,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:43,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003006723] [2019-12-19 03:24:43,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:44,032 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-19 03:24:44,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003006723] [2019-12-19 03:24:44,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:44,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:24:44,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104689776] [2019-12-19 03:24:44,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:24:44,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:44,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:24:44,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:24:44,035 INFO L87 Difference]: Start difference. First operand 43887 states and 160764 transitions. Second operand 7 states. [2019-12-19 03:24:45,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:45,534 INFO L93 Difference]: Finished difference Result 55883 states and 200498 transitions. [2019-12-19 03:24:45,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:24:45,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 03:24:45,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:45,655 INFO L225 Difference]: With dead ends: 55883 [2019-12-19 03:24:45,655 INFO L226 Difference]: Without dead ends: 55643 [2019-12-19 03:24:45,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 03:24:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55643 states. [2019-12-19 03:24:46,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55643 to 45113. [2019-12-19 03:24:46,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45113 states. [2019-12-19 03:24:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45113 states to 45113 states and 164931 transitions. [2019-12-19 03:24:49,105 INFO L78 Accepts]: Start accepts. Automaton has 45113 states and 164931 transitions. Word has length 65 [2019-12-19 03:24:49,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:49,105 INFO L462 AbstractCegarLoop]: Abstraction has 45113 states and 164931 transitions. [2019-12-19 03:24:49,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:24:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 45113 states and 164931 transitions. [2019-12-19 03:24:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:49,143 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:49,143 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-19 03:24:49,143 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:49,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1623997529, now seen corresponding path program 1 times [2019-12-19 03:24:49,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:49,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827218151] [2019-12-19 03:24:49,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:49,212 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-19 03:24:49,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827218151] [2019-12-19 03:24:49,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:49,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:24:49,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596384692] [2019-12-19 03:24:49,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:24:49,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:49,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:24:49,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:49,214 INFO L87 Difference]: Start difference. First operand 45113 states and 164931 transitions. Second operand 4 states. [2019-12-19 03:24:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:49,756 INFO L93 Difference]: Finished difference Result 69395 states and 251987 transitions. [2019-12-19 03:24:49,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:24:49,756 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 03:24:49,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:49,907 INFO L225 Difference]: With dead ends: 69395 [2019-12-19 03:24:49,907 INFO L226 Difference]: Without dead ends: 69395 [2019-12-19 03:24:49,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69395 states. [2019-12-19 03:24:51,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69395 to 53603. [2019-12-19 03:24:51,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53603 states. [2019-12-19 03:24:51,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53603 states to 53603 states and 195396 transitions. [2019-12-19 03:24:51,225 INFO L78 Accepts]: Start accepts. Automaton has 53603 states and 195396 transitions. Word has length 66 [2019-12-19 03:24:51,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:51,225 INFO L462 AbstractCegarLoop]: Abstraction has 53603 states and 195396 transitions. [2019-12-19 03:24:51,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:24:51,225 INFO L276 IsEmpty]: Start isEmpty. Operand 53603 states and 195396 transitions. [2019-12-19 03:24:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:51,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:51,266 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-19 03:24:51,267 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:51,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:51,267 INFO L82 PathProgramCache]: Analyzing trace with hash 811914503, now seen corresponding path program 1 times [2019-12-19 03:24:51,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:51,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230592979] [2019-12-19 03:24:51,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:51,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-19 03:24:51,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230592979] [2019-12-19 03:24:51,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:51,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:24:51,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756508332] [2019-12-19 03:24:51,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:24:51,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:51,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:24:51,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:24:51,344 INFO L87 Difference]: Start difference. First operand 53603 states and 195396 transitions. Second operand 7 states. [2019-12-19 03:24:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:52,969 INFO L93 Difference]: Finished difference Result 63814 states and 228863 transitions. [2019-12-19 03:24:52,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 03:24:52,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 03:24:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:53,107 INFO L225 Difference]: With dead ends: 63814 [2019-12-19 03:24:53,107 INFO L226 Difference]: Without dead ends: 63614 [2019-12-19 03:24:53,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 03:24:53,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63614 states. [2019-12-19 03:24:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63614 to 54372. [2019-12-19 03:24:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54372 states. [2019-12-19 03:24:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54372 states to 54372 states and 197926 transitions. [2019-12-19 03:24:54,847 INFO L78 Accepts]: Start accepts. Automaton has 54372 states and 197926 transitions. Word has length 66 [2019-12-19 03:24:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:54,847 INFO L462 AbstractCegarLoop]: Abstraction has 54372 states and 197926 transitions. [2019-12-19 03:24:54,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:24:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 54372 states and 197926 transitions. [2019-12-19 03:24:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:24:54,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:54,906 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, 1] [2019-12-19 03:24:54,906 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2098261969, now seen corresponding path program 1 times [2019-12-19 03:24:54,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:54,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837139775] [2019-12-19 03:24:54,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:54,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:55,032 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-19 03:24:55,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837139775] [2019-12-19 03:24:55,033 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:55,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:24:55,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232669777] [2019-12-19 03:24:55,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:24:55,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:55,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:24:55,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:24:55,035 INFO L87 Difference]: Start difference. First operand 54372 states and 197926 transitions. Second operand 6 states. [2019-12-19 03:24:55,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:55,879 INFO L93 Difference]: Finished difference Result 75809 states and 274644 transitions. [2019-12-19 03:24:55,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:55,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 03:24:55,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:56,040 INFO L225 Difference]: With dead ends: 75809 [2019-12-19 03:24:56,040 INFO L226 Difference]: Without dead ends: 75165 [2019-12-19 03:24:56,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:56,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75165 states. [2019-12-19 03:24:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75165 to 65272. [2019-12-19 03:24:59,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65272 states. [2019-12-19 03:24:59,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65272 states to 65272 states and 238097 transitions. [2019-12-19 03:24:59,671 INFO L78 Accepts]: Start accepts. Automaton has 65272 states and 238097 transitions. Word has length 68 [2019-12-19 03:24:59,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:59,672 INFO L462 AbstractCegarLoop]: Abstraction has 65272 states and 238097 transitions. [2019-12-19 03:24:59,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:24:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 65272 states and 238097 transitions. [2019-12-19 03:24:59,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:24:59,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:59,725 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, 1] [2019-12-19 03:24:59,726 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1136647952, now seen corresponding path program 1 times [2019-12-19 03:24:59,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:59,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213651568] [2019-12-19 03:24:59,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:59,838 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-19 03:24:59,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213651568] [2019-12-19 03:24:59,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:59,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:24:59,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201143257] [2019-12-19 03:24:59,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:24:59,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:24:59,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:24:59,841 INFO L87 Difference]: Start difference. First operand 65272 states and 238097 transitions. Second operand 7 states. [2019-12-19 03:25:01,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:01,528 INFO L93 Difference]: Finished difference Result 92233 states and 326439 transitions. [2019-12-19 03:25:01,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:25:01,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 03:25:01,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:01,737 INFO L225 Difference]: With dead ends: 92233 [2019-12-19 03:25:01,737 INFO L226 Difference]: Without dead ends: 92233 [2019-12-19 03:25:01,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:25:02,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92233 states. [2019-12-19 03:25:03,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92233 to 84342. [2019-12-19 03:25:03,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84342 states. [2019-12-19 03:25:03,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84342 states to 84342 states and 301206 transitions. [2019-12-19 03:25:03,902 INFO L78 Accepts]: Start accepts. Automaton has 84342 states and 301206 transitions. Word has length 68 [2019-12-19 03:25:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:03,902 INFO L462 AbstractCegarLoop]: Abstraction has 84342 states and 301206 transitions. [2019-12-19 03:25:03,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:25:03,903 INFO L276 IsEmpty]: Start isEmpty. Operand 84342 states and 301206 transitions. [2019-12-19 03:25:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 03:25:03,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:03,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, 1, 1, 1] [2019-12-19 03:25:03,982 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:03,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:03,983 INFO L82 PathProgramCache]: Analyzing trace with hash 108116529, now seen corresponding path program 1 times [2019-12-19 03:25:03,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:03,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882795439] [2019-12-19 03:25:03,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:04,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:25:04,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882795439] [2019-12-19 03:25:04,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:04,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:25:04,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413344433] [2019-12-19 03:25:04,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:25:04,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:04,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:25:04,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:25:04,047 INFO L87 Difference]: Start difference. First operand 84342 states and 301206 transitions. Second operand 3 states. [2019-12-19 03:25:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:04,400 INFO L93 Difference]: Finished difference Result 63501 states and 230470 transitions. [2019-12-19 03:25:04,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:25:04,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 03:25:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:04,536 INFO L225 Difference]: With dead ends: 63501 [2019-12-19 03:25:04,536 INFO L226 Difference]: Without dead ends: 63339 [2019-12-19 03:25:04,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:25:04,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63339 states. [2019-12-19 03:25:08,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63339 to 63299. [2019-12-19 03:25:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63299 states. [2019-12-19 03:25:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63299 states to 63299 states and 229885 transitions. [2019-12-19 03:25:08,605 INFO L78 Accepts]: Start accepts. Automaton has 63299 states and 229885 transitions. Word has length 68 [2019-12-19 03:25:08,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:08,605 INFO L462 AbstractCegarLoop]: Abstraction has 63299 states and 229885 transitions. [2019-12-19 03:25:08,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:25:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 63299 states and 229885 transitions. [2019-12-19 03:25:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:25:08,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:08,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, 1, 1] [2019-12-19 03:25:08,655 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:08,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:08,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1961517310, now seen corresponding path program 1 times [2019-12-19 03:25:08,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:08,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242958155] [2019-12-19 03:25:08,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:08,750 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-19 03:25:08,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242958155] [2019-12-19 03:25:08,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:08,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:25:08,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023160284] [2019-12-19 03:25:08,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:25:08,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:08,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:25:08,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:08,753 INFO L87 Difference]: Start difference. First operand 63299 states and 229885 transitions. Second operand 5 states. [2019-12-19 03:25:09,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:09,472 INFO L93 Difference]: Finished difference Result 84427 states and 303655 transitions. [2019-12-19 03:25:09,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:25:09,473 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 03:25:09,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:09,665 INFO L225 Difference]: With dead ends: 84427 [2019-12-19 03:25:09,665 INFO L226 Difference]: Without dead ends: 84231 [2019-12-19 03:25:09,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:25:10,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84231 states. [2019-12-19 03:25:11,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84231 to 76146. [2019-12-19 03:25:11,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76146 states. [2019-12-19 03:25:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76146 states to 76146 states and 275543 transitions. [2019-12-19 03:25:11,632 INFO L78 Accepts]: Start accepts. Automaton has 76146 states and 275543 transitions. Word has length 69 [2019-12-19 03:25:11,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:11,633 INFO L462 AbstractCegarLoop]: Abstraction has 76146 states and 275543 transitions. [2019-12-19 03:25:11,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:11,633 INFO L276 IsEmpty]: Start isEmpty. Operand 76146 states and 275543 transitions. [2019-12-19 03:25:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 03:25:11,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:11,707 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, 1, 1] [2019-12-19 03:25:11,707 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:11,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:11,708 INFO L82 PathProgramCache]: Analyzing trace with hash -716752829, now seen corresponding path program 1 times [2019-12-19 03:25:11,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:11,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956660764] [2019-12-19 03:25:11,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:11,844 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-19 03:25:11,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956660764] [2019-12-19 03:25:11,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:11,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:25:11,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498000627] [2019-12-19 03:25:11,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:25:11,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:11,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:25:11,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:11,847 INFO L87 Difference]: Start difference. First operand 76146 states and 275543 transitions. Second operand 5 states. [2019-12-19 03:25:12,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:12,688 INFO L93 Difference]: Finished difference Result 19614 states and 62264 transitions. [2019-12-19 03:25:12,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:25:12,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 03:25:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:12,723 INFO L225 Difference]: With dead ends: 19614 [2019-12-19 03:25:12,723 INFO L226 Difference]: Without dead ends: 19136 [2019-12-19 03:25:12,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:25:12,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19136 states. [2019-12-19 03:25:12,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19136 to 19124. [2019-12-19 03:25:12,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19124 states. [2019-12-19 03:25:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19124 states to 19124 states and 60759 transitions. [2019-12-19 03:25:12,977 INFO L78 Accepts]: Start accepts. Automaton has 19124 states and 60759 transitions. Word has length 69 [2019-12-19 03:25:12,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:12,977 INFO L462 AbstractCegarLoop]: Abstraction has 19124 states and 60759 transitions. [2019-12-19 03:25:12,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:12,977 INFO L276 IsEmpty]: Start isEmpty. Operand 19124 states and 60759 transitions. [2019-12-19 03:25:12,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 03:25:12,994 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:12,994 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:12,995 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:12,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:12,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1120176018, now seen corresponding path program 1 times [2019-12-19 03:25:12,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:12,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593860226] [2019-12-19 03:25:12,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:13,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:25:13,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593860226] [2019-12-19 03:25:13,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:13,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:25:13,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626511856] [2019-12-19 03:25:13,048 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:25:13,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:13,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:25:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:25:13,048 INFO L87 Difference]: Start difference. First operand 19124 states and 60759 transitions. Second operand 4 states. [2019-12-19 03:25:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:13,379 INFO L93 Difference]: Finished difference Result 24074 states and 75427 transitions. [2019-12-19 03:25:13,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:25:13,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-19 03:25:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:13,437 INFO L225 Difference]: With dead ends: 24074 [2019-12-19 03:25:13,437 INFO L226 Difference]: Without dead ends: 24074 [2019-12-19 03:25:13,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-19 03:25:13,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24074 states. [2019-12-19 03:25:13,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24074 to 19964. [2019-12-19 03:25:13,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19964 states. [2019-12-19 03:25:13,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19964 states to 19964 states and 63126 transitions. [2019-12-19 03:25:13,756 INFO L78 Accepts]: Start accepts. Automaton has 19964 states and 63126 transitions. Word has length 78 [2019-12-19 03:25:13,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:13,756 INFO L462 AbstractCegarLoop]: Abstraction has 19964 states and 63126 transitions. [2019-12-19 03:25:13,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:25:13,756 INFO L276 IsEmpty]: Start isEmpty. Operand 19964 states and 63126 transitions. [2019-12-19 03:25:13,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 03:25:13,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:13,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:13,773 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:13,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:13,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1374912563, now seen corresponding path program 1 times [2019-12-19 03:25:13,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:13,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493094662] [2019-12-19 03:25:13,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:13,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 03:25:13,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493094662] [2019-12-19 03:25:13,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:13,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:25:13,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232356162] [2019-12-19 03:25:13,875 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:25:13,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:25:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:25:13,876 INFO L87 Difference]: Start difference. First operand 19964 states and 63126 transitions. Second operand 8 states. [2019-12-19 03:25:14,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:14,822 INFO L93 Difference]: Finished difference Result 22070 states and 69318 transitions. [2019-12-19 03:25:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 03:25:14,822 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-19 03:25:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:14,872 INFO L225 Difference]: With dead ends: 22070 [2019-12-19 03:25:14,872 INFO L226 Difference]: Without dead ends: 22022 [2019-12-19 03:25:14,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-19 03:25:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22022 states. [2019-12-19 03:25:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22022 to 19436. [2019-12-19 03:25:15,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19436 states. [2019-12-19 03:25:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19436 states to 19436 states and 61628 transitions. [2019-12-19 03:25:15,186 INFO L78 Accepts]: Start accepts. Automaton has 19436 states and 61628 transitions. Word has length 78 [2019-12-19 03:25:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:15,186 INFO L462 AbstractCegarLoop]: Abstraction has 19436 states and 61628 transitions. [2019-12-19 03:25:15,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:25:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 19436 states and 61628 transitions. [2019-12-19 03:25:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 03:25:15,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:15,206 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:15,206 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:15,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:15,206 INFO L82 PathProgramCache]: Analyzing trace with hash -12906451, now seen corresponding path program 1 times [2019-12-19 03:25:15,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:15,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572504060] [2019-12-19 03:25:15,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:15,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:15,301 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-19 03:25:15,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572504060] [2019-12-19 03:25:15,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:15,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 03:25:15,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675872289] [2019-12-19 03:25:15,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 03:25:15,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:15,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 03:25:15,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:25:15,303 INFO L87 Difference]: Start difference. First operand 19436 states and 61628 transitions. Second operand 8 states. [2019-12-19 03:25:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:17,799 INFO L93 Difference]: Finished difference Result 50430 states and 153646 transitions. [2019-12-19 03:25:17,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 03:25:17,799 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-12-19 03:25:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:17,877 INFO L225 Difference]: With dead ends: 50430 [2019-12-19 03:25:17,877 INFO L226 Difference]: Without dead ends: 49731 [2019-12-19 03:25:17,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-19 03:25:17,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49731 states. [2019-12-19 03:25:18,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49731 to 29964. [2019-12-19 03:25:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29964 states. [2019-12-19 03:25:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29964 states to 29964 states and 93558 transitions. [2019-12-19 03:25:18,407 INFO L78 Accepts]: Start accepts. Automaton has 29964 states and 93558 transitions. Word has length 81 [2019-12-19 03:25:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:18,407 INFO L462 AbstractCegarLoop]: Abstraction has 29964 states and 93558 transitions. [2019-12-19 03:25:18,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 03:25:18,407 INFO L276 IsEmpty]: Start isEmpty. Operand 29964 states and 93558 transitions. [2019-12-19 03:25:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 03:25:18,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:18,435 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:18,435 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:18,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:18,435 INFO L82 PathProgramCache]: Analyzing trace with hash 948707566, now seen corresponding path program 1 times [2019-12-19 03:25:18,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:18,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457011366] [2019-12-19 03:25:18,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:18,529 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-19 03:25:18,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457011366] [2019-12-19 03:25:18,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:18,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:25:18,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758791987] [2019-12-19 03:25:18,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:25:18,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:18,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:25:18,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:18,536 INFO L87 Difference]: Start difference. First operand 29964 states and 93558 transitions. Second operand 6 states. [2019-12-19 03:25:19,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:19,031 INFO L93 Difference]: Finished difference Result 31402 states and 97495 transitions. [2019-12-19 03:25:19,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:25:19,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 03:25:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:19,085 INFO L225 Difference]: With dead ends: 31402 [2019-12-19 03:25:19,085 INFO L226 Difference]: Without dead ends: 31402 [2019-12-19 03:25:19,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:25:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31402 states. [2019-12-19 03:25:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31402 to 29633. [2019-12-19 03:25:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29633 states. [2019-12-19 03:25:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29633 states to 29633 states and 92401 transitions. [2019-12-19 03:25:19,849 INFO L78 Accepts]: Start accepts. Automaton has 29633 states and 92401 transitions. Word has length 81 [2019-12-19 03:25:19,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:19,849 INFO L462 AbstractCegarLoop]: Abstraction has 29633 states and 92401 transitions. [2019-12-19 03:25:19,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:25:19,849 INFO L276 IsEmpty]: Start isEmpty. Operand 29633 states and 92401 transitions. [2019-12-19 03:25:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 03:25:19,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:19,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:19,878 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:19,878 INFO L82 PathProgramCache]: Analyzing trace with hash -986952721, now seen corresponding path program 1 times [2019-12-19 03:25:19,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:19,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506682787] [2019-12-19 03:25:19,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:19,967 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-19 03:25:19,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506682787] [2019-12-19 03:25:19,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:19,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:25:19,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381650674] [2019-12-19 03:25:19,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:25:19,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:19,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:25:19,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:25:19,970 INFO L87 Difference]: Start difference. First operand 29633 states and 92401 transitions. Second operand 7 states. [2019-12-19 03:25:20,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:20,637 INFO L93 Difference]: Finished difference Result 31147 states and 96557 transitions. [2019-12-19 03:25:20,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:25:20,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-19 03:25:20,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:20,684 INFO L225 Difference]: With dead ends: 31147 [2019-12-19 03:25:20,684 INFO L226 Difference]: Without dead ends: 31147 [2019-12-19 03:25:20,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:25:20,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31147 states. [2019-12-19 03:25:21,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31147 to 29965. [2019-12-19 03:25:21,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29965 states. [2019-12-19 03:25:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 93232 transitions. [2019-12-19 03:25:21,098 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 93232 transitions. Word has length 81 [2019-12-19 03:25:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:21,099 INFO L462 AbstractCegarLoop]: Abstraction has 29965 states and 93232 transitions. [2019-12-19 03:25:21,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:25:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 93232 transitions. [2019-12-19 03:25:21,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 03:25:21,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:21,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:21,129 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:21,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:21,130 INFO L82 PathProgramCache]: Analyzing trace with hash -657186960, now seen corresponding path program 1 times [2019-12-19 03:25:21,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:21,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865422296] [2019-12-19 03:25:21,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:21,166 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-19 03:25:21,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865422296] [2019-12-19 03:25:21,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:21,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:25:21,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117907113] [2019-12-19 03:25:21,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:25:21,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:21,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:25:21,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:25:21,169 INFO L87 Difference]: Start difference. First operand 29965 states and 93232 transitions. Second operand 3 states. [2019-12-19 03:25:21,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:21,302 INFO L93 Difference]: Finished difference Result 21486 states and 66269 transitions. [2019-12-19 03:25:21,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:25:21,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-19 03:25:21,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:21,351 INFO L225 Difference]: With dead ends: 21486 [2019-12-19 03:25:21,352 INFO L226 Difference]: Without dead ends: 21486 [2019-12-19 03:25:21,352 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-19 03:25:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21486 states. [2019-12-19 03:25:21,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21486 to 21163. [2019-12-19 03:25:21,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21163 states. [2019-12-19 03:25:21,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21163 states to 21163 states and 65320 transitions. [2019-12-19 03:25:21,812 INFO L78 Accepts]: Start accepts. Automaton has 21163 states and 65320 transitions. Word has length 81 [2019-12-19 03:25:21,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:21,812 INFO L462 AbstractCegarLoop]: Abstraction has 21163 states and 65320 transitions. [2019-12-19 03:25:21,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:25:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 21163 states and 65320 transitions. [2019-12-19 03:25:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:25:21,850 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:21,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:21,850 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:21,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash 983805704, now seen corresponding path program 1 times [2019-12-19 03:25:21,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:21,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133211713] [2019-12-19 03:25:21,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:21,921 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-19 03:25:21,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133211713] [2019-12-19 03:25:21,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:21,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:25:21,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434847037] [2019-12-19 03:25:21,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:25:21,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:21,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:25:21,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:25:21,923 INFO L87 Difference]: Start difference. First operand 21163 states and 65320 transitions. Second operand 4 states. [2019-12-19 03:25:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:22,423 INFO L93 Difference]: Finished difference Result 26080 states and 79433 transitions. [2019-12-19 03:25:22,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:25:22,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-19 03:25:22,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:22,481 INFO L225 Difference]: With dead ends: 26080 [2019-12-19 03:25:22,481 INFO L226 Difference]: Without dead ends: 25972 [2019-12-19 03:25:22,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:25:22,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25972 states. [2019-12-19 03:25:22,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25972 to 23743. [2019-12-19 03:25:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23743 states. [2019-12-19 03:25:22,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23743 states to 23743 states and 72888 transitions. [2019-12-19 03:25:22,888 INFO L78 Accepts]: Start accepts. Automaton has 23743 states and 72888 transitions. Word has length 82 [2019-12-19 03:25:22,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:22,888 INFO L462 AbstractCegarLoop]: Abstraction has 23743 states and 72888 transitions. [2019-12-19 03:25:22,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:25:22,888 INFO L276 IsEmpty]: Start isEmpty. Operand 23743 states and 72888 transitions. [2019-12-19 03:25:22,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:25:22,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:22,908 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:22,909 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:22,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:22,909 INFO L82 PathProgramCache]: Analyzing trace with hash 61122121, now seen corresponding path program 1 times [2019-12-19 03:25:22,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:22,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696310072] [2019-12-19 03:25:22,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:23,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-19 03:25:23,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696310072] [2019-12-19 03:25:23,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:23,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:25:23,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315992471] [2019-12-19 03:25:23,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:25:23,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:25:23,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:23,011 INFO L87 Difference]: Start difference. First operand 23743 states and 72888 transitions. Second operand 6 states. [2019-12-19 03:25:23,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:23,725 INFO L93 Difference]: Finished difference Result 26033 states and 79294 transitions. [2019-12-19 03:25:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:25:23,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-12-19 03:25:23,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:23,763 INFO L225 Difference]: With dead ends: 26033 [2019-12-19 03:25:23,763 INFO L226 Difference]: Without dead ends: 26009 [2019-12-19 03:25:23,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:25:23,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26009 states. [2019-12-19 03:25:24,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26009 to 25008. [2019-12-19 03:25:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25008 states. [2019-12-19 03:25:24,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25008 states to 25008 states and 76355 transitions. [2019-12-19 03:25:24,087 INFO L78 Accepts]: Start accepts. Automaton has 25008 states and 76355 transitions. Word has length 82 [2019-12-19 03:25:24,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:24,087 INFO L462 AbstractCegarLoop]: Abstraction has 25008 states and 76355 transitions. [2019-12-19 03:25:24,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:25:24,087 INFO L276 IsEmpty]: Start isEmpty. Operand 25008 states and 76355 transitions. [2019-12-19 03:25:24,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:25:24,109 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:24,109 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:24,109 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:24,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:24,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1874538166, now seen corresponding path program 1 times [2019-12-19 03:25:24,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:24,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882974715] [2019-12-19 03:25:24,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:24,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:24,229 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-19 03:25:24,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882974715] [2019-12-19 03:25:24,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:24,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:25:24,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665612081] [2019-12-19 03:25:24,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:25:24,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:24,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:25:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:24,244 INFO L87 Difference]: Start difference. First operand 25008 states and 76355 transitions. Second operand 6 states. [2019-12-19 03:25:24,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:24,922 INFO L93 Difference]: Finished difference Result 32577 states and 96112 transitions. [2019-12-19 03:25:24,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:25:24,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-12-19 03:25:24,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:24,970 INFO L225 Difference]: With dead ends: 32577 [2019-12-19 03:25:24,970 INFO L226 Difference]: Without dead ends: 32564 [2019-12-19 03:25:24,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:25:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32564 states. [2019-12-19 03:25:25,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32564 to 27961. [2019-12-19 03:25:25,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27961 states. [2019-12-19 03:25:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27961 states to 27961 states and 83312 transitions. [2019-12-19 03:25:25,367 INFO L78 Accepts]: Start accepts. Automaton has 27961 states and 83312 transitions. Word has length 82 [2019-12-19 03:25:25,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:25,367 INFO L462 AbstractCegarLoop]: Abstraction has 27961 states and 83312 transitions. [2019-12-19 03:25:25,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:25:25,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27961 states and 83312 transitions. [2019-12-19 03:25:25,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:25:25,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:25,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:25,391 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:25,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:25,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1544772405, now seen corresponding path program 1 times [2019-12-19 03:25:25,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:25,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931031797] [2019-12-19 03:25:25,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:25,465 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-19 03:25:25,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931031797] [2019-12-19 03:25:25,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:25,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:25:25,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514938507] [2019-12-19 03:25:25,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:25:25,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:25,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:25:25,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:25,467 INFO L87 Difference]: Start difference. First operand 27961 states and 83312 transitions. Second operand 5 states. [2019-12-19 03:25:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:25,874 INFO L93 Difference]: Finished difference Result 33403 states and 98789 transitions. [2019-12-19 03:25:25,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:25:25,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-12-19 03:25:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:25,923 INFO L225 Difference]: With dead ends: 33403 [2019-12-19 03:25:25,924 INFO L226 Difference]: Without dead ends: 33403 [2019-12-19 03:25:25,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 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-19 03:25:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33403 states. [2019-12-19 03:25:26,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33403 to 27283. [2019-12-19 03:25:26,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27283 states. [2019-12-19 03:25:26,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27283 states to 27283 states and 81291 transitions. [2019-12-19 03:25:26,327 INFO L78 Accepts]: Start accepts. Automaton has 27283 states and 81291 transitions. Word has length 82 [2019-12-19 03:25:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:26,327 INFO L462 AbstractCegarLoop]: Abstraction has 27283 states and 81291 transitions. [2019-12-19 03:25:26,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:26,328 INFO L276 IsEmpty]: Start isEmpty. Operand 27283 states and 81291 transitions. [2019-12-19 03:25:26,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:25:26,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:26,351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:26,351 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:26,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:26,351 INFO L82 PathProgramCache]: Analyzing trace with hash 740091050, now seen corresponding path program 1 times [2019-12-19 03:25:26,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:26,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358033873] [2019-12-19 03:25:26,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:26,410 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-19 03:25:26,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358033873] [2019-12-19 03:25:26,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:26,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:25:26,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26340683] [2019-12-19 03:25:26,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:25:26,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:26,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:25:26,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:25:26,412 INFO L87 Difference]: Start difference. First operand 27283 states and 81291 transitions. Second operand 4 states. [2019-12-19 03:25:27,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:27,085 INFO L93 Difference]: Finished difference Result 31432 states and 92484 transitions. [2019-12-19 03:25:27,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:25:27,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-19 03:25:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:27,152 INFO L225 Difference]: With dead ends: 31432 [2019-12-19 03:25:27,152 INFO L226 Difference]: Without dead ends: 30982 [2019-12-19 03:25:27,152 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-19 03:25:27,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30982 states. [2019-12-19 03:25:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30982 to 26929. [2019-12-19 03:25:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26929 states. [2019-12-19 03:25:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26929 states to 26929 states and 80065 transitions. [2019-12-19 03:25:27,591 INFO L78 Accepts]: Start accepts. Automaton has 26929 states and 80065 transitions. Word has length 82 [2019-12-19 03:25:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:27,592 INFO L462 AbstractCegarLoop]: Abstraction has 26929 states and 80065 transitions. [2019-12-19 03:25:27,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:25:27,592 INFO L276 IsEmpty]: Start isEmpty. Operand 26929 states and 80065 transitions. [2019-12-19 03:25:27,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:25:27,612 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:27,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:27,612 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:27,613 INFO L82 PathProgramCache]: Analyzing trace with hash 456940586, now seen corresponding path program 1 times [2019-12-19 03:25:27,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:27,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19340595] [2019-12-19 03:25:27,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:27,680 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-19 03:25:27,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19340595] [2019-12-19 03:25:27,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:27,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:25:27,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247633077] [2019-12-19 03:25:27,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:25:27,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:27,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:25:27,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:27,682 INFO L87 Difference]: Start difference. First operand 26929 states and 80065 transitions. Second operand 5 states. [2019-12-19 03:25:28,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:28,027 INFO L93 Difference]: Finished difference Result 23125 states and 67572 transitions. [2019-12-19 03:25:28,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:25:28,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-12-19 03:25:28,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:28,058 INFO L225 Difference]: With dead ends: 23125 [2019-12-19 03:25:28,059 INFO L226 Difference]: Without dead ends: 22969 [2019-12-19 03:25:28,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:25:28,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22969 states. [2019-12-19 03:25:28,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22969 to 18282. [2019-12-19 03:25:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18282 states. [2019-12-19 03:25:28,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18282 states to 18282 states and 54149 transitions. [2019-12-19 03:25:28,321 INFO L78 Accepts]: Start accepts. Automaton has 18282 states and 54149 transitions. Word has length 82 [2019-12-19 03:25:28,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:28,321 INFO L462 AbstractCegarLoop]: Abstraction has 18282 states and 54149 transitions. [2019-12-19 03:25:28,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:28,321 INFO L276 IsEmpty]: Start isEmpty. Operand 18282 states and 54149 transitions. [2019-12-19 03:25:28,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-19 03:25:28,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:28,338 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:25:28,338 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:28,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:28,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1701705067, now seen corresponding path program 1 times [2019-12-19 03:25:28,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:28,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766976168] [2019-12-19 03:25:28,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:28,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:28,400 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-19 03:25:28,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766976168] [2019-12-19 03:25:28,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:28,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:25:28,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718355164] [2019-12-19 03:25:28,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:25:28,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:28,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:25:28,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:28,402 INFO L87 Difference]: Start difference. First operand 18282 states and 54149 transitions. Second operand 5 states. [2019-12-19 03:25:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:28,445 INFO L93 Difference]: Finished difference Result 2364 states and 5647 transitions. [2019-12-19 03:25:28,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:25:28,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-12-19 03:25:28,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:28,448 INFO L225 Difference]: With dead ends: 2364 [2019-12-19 03:25:28,448 INFO L226 Difference]: Without dead ends: 2076 [2019-12-19 03:25:28,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 03:25:28,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2019-12-19 03:25:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 2021. [2019-12-19 03:25:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-12-19 03:25:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 4817 transitions. [2019-12-19 03:25:28,480 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 4817 transitions. Word has length 82 [2019-12-19 03:25:28,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:28,480 INFO L462 AbstractCegarLoop]: Abstraction has 2021 states and 4817 transitions. [2019-12-19 03:25:28,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:28,481 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 4817 transitions. [2019-12-19 03:25:28,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:28,483 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:28,484 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, 1, 1, 1, 1, 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-19 03:25:28,484 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:28,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:28,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1787288701, now seen corresponding path program 1 times [2019-12-19 03:25:28,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:28,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504484539] [2019-12-19 03:25:28,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:28,574 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-19 03:25:28,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504484539] [2019-12-19 03:25:28,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:28,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:25:28,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868340184] [2019-12-19 03:25:28,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:25:28,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:28,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:25:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:28,576 INFO L87 Difference]: Start difference. First operand 2021 states and 4817 transitions. Second operand 5 states. [2019-12-19 03:25:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:28,885 INFO L93 Difference]: Finished difference Result 2371 states and 5549 transitions. [2019-12-19 03:25:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:25:28,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 03:25:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:28,889 INFO L225 Difference]: With dead ends: 2371 [2019-12-19 03:25:28,889 INFO L226 Difference]: Without dead ends: 2353 [2019-12-19 03:25:28,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-12-19 03:25:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2074. [2019-12-19 03:25:28,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-12-19 03:25:28,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 4920 transitions. [2019-12-19 03:25:28,921 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 4920 transitions. Word has length 95 [2019-12-19 03:25:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:28,922 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 4920 transitions. [2019-12-19 03:25:28,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:28,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 4920 transitions. [2019-12-19 03:25:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:28,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:28,925 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, 1, 1, 1, 1, 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-19 03:25:28,925 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:28,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:28,925 INFO L82 PathProgramCache]: Analyzing trace with hash 762594780, now seen corresponding path program 1 times [2019-12-19 03:25:28,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:28,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660722843] [2019-12-19 03:25:28,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:28,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:28,984 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-19 03:25:28,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660722843] [2019-12-19 03:25:28,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:28,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:25:28,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746455622] [2019-12-19 03:25:28,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:25:28,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:25:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:28,986 INFO L87 Difference]: Start difference. First operand 2074 states and 4920 transitions. Second operand 5 states. [2019-12-19 03:25:29,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:29,179 INFO L93 Difference]: Finished difference Result 2463 states and 5723 transitions. [2019-12-19 03:25:29,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:25:29,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 03:25:29,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:29,183 INFO L225 Difference]: With dead ends: 2463 [2019-12-19 03:25:29,183 INFO L226 Difference]: Without dead ends: 2445 [2019-12-19 03:25:29,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:25:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2019-12-19 03:25:29,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 2140. [2019-12-19 03:25:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-12-19 03:25:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 5048 transitions. [2019-12-19 03:25:29,206 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 5048 transitions. Word has length 95 [2019-12-19 03:25:29,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:29,206 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 5048 transitions. [2019-12-19 03:25:29,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:29,206 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 5048 transitions. [2019-12-19 03:25:29,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:29,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:29,208 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, 1, 1, 1, 1, 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-19 03:25:29,208 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:29,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:29,209 INFO L82 PathProgramCache]: Analyzing trace with hash -238075170, now seen corresponding path program 1 times [2019-12-19 03:25:29,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:29,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70357628] [2019-12-19 03:25:29,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:29,325 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-19 03:25:29,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70357628] [2019-12-19 03:25:29,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:29,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:25:29,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379434208] [2019-12-19 03:25:29,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:25:29,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:29,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:25:29,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:29,327 INFO L87 Difference]: Start difference. First operand 2140 states and 5048 transitions. Second operand 6 states. [2019-12-19 03:25:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:29,649 INFO L93 Difference]: Finished difference Result 2293 states and 5327 transitions. [2019-12-19 03:25:29,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:25:29,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 03:25:29,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:29,653 INFO L225 Difference]: With dead ends: 2293 [2019-12-19 03:25:29,653 INFO L226 Difference]: Without dead ends: 2293 [2019-12-19 03:25:29,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-19 03:25:29,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-12-19 03:25:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2128. [2019-12-19 03:25:29,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2019-12-19 03:25:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 5005 transitions. [2019-12-19 03:25:29,684 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 5005 transitions. Word has length 95 [2019-12-19 03:25:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:29,684 INFO L462 AbstractCegarLoop]: Abstraction has 2128 states and 5005 transitions. [2019-12-19 03:25:29,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:25:29,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 5005 transitions. [2019-12-19 03:25:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:29,687 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:29,687 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, 1, 1, 1, 1, 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-19 03:25:29,687 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash 91690591, now seen corresponding path program 1 times [2019-12-19 03:25:29,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:29,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352892986] [2019-12-19 03:25:29,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:29,768 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-19 03:25:29,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352892986] [2019-12-19 03:25:29,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:29,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:25:29,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338160324] [2019-12-19 03:25:29,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:25:29,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:29,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:25:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:29,770 INFO L87 Difference]: Start difference. First operand 2128 states and 5005 transitions. Second operand 6 states. [2019-12-19 03:25:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:29,981 INFO L93 Difference]: Finished difference Result 2318 states and 5399 transitions. [2019-12-19 03:25:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:25:29,981 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 03:25:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:29,984 INFO L225 Difference]: With dead ends: 2318 [2019-12-19 03:25:29,984 INFO L226 Difference]: Without dead ends: 2318 [2019-12-19 03:25:29,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2318 states. [2019-12-19 03:25:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2318 to 2110. [2019-12-19 03:25:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2110 states. [2019-12-19 03:25:30,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 4969 transitions. [2019-12-19 03:25:30,004 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 4969 transitions. Word has length 95 [2019-12-19 03:25:30,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:30,005 INFO L462 AbstractCegarLoop]: Abstraction has 2110 states and 4969 transitions. [2019-12-19 03:25:30,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:25:30,005 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 4969 transitions. [2019-12-19 03:25:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:30,006 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:30,007 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, 1, 1, 1, 1, 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-19 03:25:30,007 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:30,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:30,007 INFO L82 PathProgramCache]: Analyzing trace with hash 2073007519, now seen corresponding path program 1 times [2019-12-19 03:25:30,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:30,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482466654] [2019-12-19 03:25:30,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:30,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:30,131 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-19 03:25:30,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482466654] [2019-12-19 03:25:30,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:30,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:25:30,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453599357] [2019-12-19 03:25:30,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:25:30,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:30,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:25:30,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:25:30,133 INFO L87 Difference]: Start difference. First operand 2110 states and 4969 transitions. Second operand 7 states. [2019-12-19 03:25:30,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:30,476 INFO L93 Difference]: Finished difference Result 2294 states and 5309 transitions. [2019-12-19 03:25:30,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:25:30,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 03:25:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:30,481 INFO L225 Difference]: With dead ends: 2294 [2019-12-19 03:25:30,481 INFO L226 Difference]: Without dead ends: 2294 [2019-12-19 03:25:30,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-19 03:25:30,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2294 states. [2019-12-19 03:25:30,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2294 to 2102. [2019-12-19 03:25:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2019-12-19 03:25:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 4932 transitions. [2019-12-19 03:25:30,501 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 4932 transitions. Word has length 95 [2019-12-19 03:25:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:30,502 INFO L462 AbstractCegarLoop]: Abstraction has 2102 states and 4932 transitions. [2019-12-19 03:25:30,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:25:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 4932 transitions. [2019-12-19 03:25:30,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:30,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:30,504 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, 1, 1, 1, 1, 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-19 03:25:30,504 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:30,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:30,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1892194016, now seen corresponding path program 1 times [2019-12-19 03:25:30,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:30,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659232034] [2019-12-19 03:25:30,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:30,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:30,646 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-19 03:25:30,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659232034] [2019-12-19 03:25:30,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:30,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-19 03:25:30,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640436735] [2019-12-19 03:25:30,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-19 03:25:30,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:30,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-19 03:25:30,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:25:30,648 INFO L87 Difference]: Start difference. First operand 2102 states and 4932 transitions. Second operand 12 states. [2019-12-19 03:25:30,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:30,885 INFO L93 Difference]: Finished difference Result 3354 states and 7969 transitions. [2019-12-19 03:25:30,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 03:25:30,886 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-12-19 03:25:30,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:30,889 INFO L225 Difference]: With dead ends: 3354 [2019-12-19 03:25:30,890 INFO L226 Difference]: Without dead ends: 2715 [2019-12-19 03:25:30,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-12-19 03:25:30,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2715 states. [2019-12-19 03:25:30,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2715 to 2591. [2019-12-19 03:25:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2591 states. [2019-12-19 03:25:30,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2591 states to 2591 states and 5999 transitions. [2019-12-19 03:25:30,924 INFO L78 Accepts]: Start accepts. Automaton has 2591 states and 5999 transitions. Word has length 95 [2019-12-19 03:25:30,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:30,925 INFO L462 AbstractCegarLoop]: Abstraction has 2591 states and 5999 transitions. [2019-12-19 03:25:30,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-19 03:25:30,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2591 states and 5999 transitions. [2019-12-19 03:25:30,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:30,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:30,928 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, 1, 1, 1, 1, 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-19 03:25:30,928 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:30,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:30,928 INFO L82 PathProgramCache]: Analyzing trace with hash -337677158, now seen corresponding path program 2 times [2019-12-19 03:25:30,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:30,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114322785] [2019-12-19 03:25:30,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:31,043 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-19 03:25:31,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114322785] [2019-12-19 03:25:31,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:31,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:25:31,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833279748] [2019-12-19 03:25:31,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:25:31,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:31,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:25:31,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:25:31,045 INFO L87 Difference]: Start difference. First operand 2591 states and 5999 transitions. Second operand 7 states. [2019-12-19 03:25:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:31,695 INFO L93 Difference]: Finished difference Result 3609 states and 8163 transitions. [2019-12-19 03:25:31,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 03:25:31,696 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 03:25:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:31,701 INFO L225 Difference]: With dead ends: 3609 [2019-12-19 03:25:31,702 INFO L226 Difference]: Without dead ends: 3567 [2019-12-19 03:25:31,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:25:31,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3567 states. [2019-12-19 03:25:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3567 to 2760. [2019-12-19 03:25:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2760 states. [2019-12-19 03:25:31,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 6333 transitions. [2019-12-19 03:25:31,772 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 6333 transitions. Word has length 95 [2019-12-19 03:25:31,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:31,772 INFO L462 AbstractCegarLoop]: Abstraction has 2760 states and 6333 transitions. [2019-12-19 03:25:31,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:25:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 6333 transitions. [2019-12-19 03:25:31,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:31,776 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:31,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:25:31,776 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2021629851, now seen corresponding path program 2 times [2019-12-19 03:25:31,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:31,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443806679] [2019-12-19 03:25:31,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:31,858 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-19 03:25:31,858 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443806679] [2019-12-19 03:25:31,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:31,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:25:31,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684258435] [2019-12-19 03:25:31,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:25:31,859 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:31,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:25:31,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:31,860 INFO L87 Difference]: Start difference. First operand 2760 states and 6333 transitions. Second operand 5 states. [2019-12-19 03:25:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:31,901 INFO L93 Difference]: Finished difference Result 3693 states and 8648 transitions. [2019-12-19 03:25:31,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:25:31,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 03:25:31,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:31,907 INFO L225 Difference]: With dead ends: 3693 [2019-12-19 03:25:31,907 INFO L226 Difference]: Without dead ends: 3693 [2019-12-19 03:25:31,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:31,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2019-12-19 03:25:31,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 2544. [2019-12-19 03:25:31,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2019-12-19 03:25:31,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 5842 transitions. [2019-12-19 03:25:31,949 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 5842 transitions. Word has length 95 [2019-12-19 03:25:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:31,949 INFO L462 AbstractCegarLoop]: Abstraction has 2544 states and 5842 transitions. [2019-12-19 03:25:31,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 5842 transitions. [2019-12-19 03:25:31,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:31,952 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:31,952 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, 1, 1, 1, 1, 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-19 03:25:31,952 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:31,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:31,953 INFO L82 PathProgramCache]: Analyzing trace with hash 24341148, now seen corresponding path program 2 times [2019-12-19 03:25:31,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:31,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101388605] [2019-12-19 03:25:31,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:25:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:25:32,084 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:25:32,084 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:25:32,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:25:32 BasicIcfg [2019-12-19 03:25:32,267 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:25:32,269 INFO L168 Benchmark]: Toolchain (without parser) took 71395.64 ms. Allocated memory was 146.3 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 103.1 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 811.2 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:32,270 INFO L168 Benchmark]: CDTParser took 0.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-19 03:25:32,270 INFO L168 Benchmark]: CACSL2BoogieTranslator took 846.74 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.7 MB in the beginning and 155.6 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:32,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:32,271 INFO L168 Benchmark]: Boogie Preprocessor took 37.62 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:32,271 INFO L168 Benchmark]: RCFGBuilder took 763.89 ms. Allocated memory is still 202.9 MB. Free memory was 150.1 MB in the beginning and 105.9 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:32,272 INFO L168 Benchmark]: TraceAbstraction took 69671.06 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 105.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 756.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:32,274 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.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 846.74 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 102.7 MB in the beginning and 155.6 MB in the end (delta: -52.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.82 ms. Allocated memory is still 202.9 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.62 ms. Allocated memory is still 202.9 MB. Free memory was 152.8 MB in the beginning and 150.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 763.89 ms. Allocated memory is still 202.9 MB. Free memory was 150.1 MB in the beginning and 105.9 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 69671.06 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 105.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 756.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L702] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L703] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L704] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L705] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L706] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L707] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L708] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L709] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L710] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L711] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L712] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L713] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L714] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L716] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] 0 pthread_t t1453; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK 0 pthread_create(&t1453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L780] 0 pthread_t t1454; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L781] FCALL, FORK 0 pthread_create(&t1454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L742] 2 x$w_buff1 = x$w_buff0 [L743] 2 x$w_buff0 = 2 [L744] 2 x$w_buff1_used = x$w_buff0_used [L745] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L747] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L748] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L749] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L750] 2 x$r_buff0_thd2 = (_Bool)1 [L753] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 1 y = 1 [L725] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L728] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L728] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=1] [L728] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L729] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L730] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L756] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L731] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L757] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L758] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L759] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L760] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L732] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L735] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L788] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L789] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L789] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L790] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L791] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L791] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 x$flush_delayed = weak$$choice2 [L797] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L799] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L800] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L801] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L802] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L804] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] 0 x = x$flush_delayed ? x$mem_tmp : x [L807] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 69.3s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 25.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9250 SDtfs, 10445 SDslu, 22265 SDs, 0 SdLazy, 10365 SolverSat, 679 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 402 GetRequests, 101 SyntacticMatches, 32 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 536 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84342occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 37.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 148278 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2746 NumberOfCodeBlocks, 2746 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2616 ConstructedInterpolants, 0 QuantifiedInterpolants, 490524 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...