/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/safe029_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:18:44,818 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:18:44,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:18:44,833 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:18:44,833 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:18:44,834 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:18:44,835 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:18:44,837 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:18:44,839 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:18:44,840 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:18:44,841 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:18:44,842 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:18:44,842 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:18:44,843 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:18:44,844 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:18:44,845 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:18:44,846 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:18:44,847 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:18:44,848 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:18:44,850 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:18:44,852 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:18:44,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:18:44,854 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:18:44,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:18:44,857 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:18:44,858 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:18:44,858 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:18:44,859 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:18:44,859 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:18:44,860 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:18:44,860 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:18:44,861 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:18:44,862 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:18:44,862 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:18:44,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:18:44,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:18:44,864 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:18:44,865 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:18:44,865 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:18:44,866 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:18:44,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:18:44,867 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 05:18:44,882 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:18:44,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:18:44,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:18:44,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:18:44,884 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:18:44,884 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:18:44,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:18:44,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:18:44,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:18:44,885 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:18:44,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:18:44,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:18:44,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:18:44,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:18:44,886 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:18:44,886 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:18:44,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:18:44,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:18:44,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:18:44,887 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:18:44,887 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:18:44,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:18:44,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:18:44,888 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:18:44,888 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:18:44,888 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:18:44,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:18:44,888 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:18:44,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:18:44,889 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:18:45,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:18:45,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:18:45,201 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:18:45,203 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:18:45,203 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:18:45,204 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-19 05:18:45,290 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb1435e/645139f787104b459cbb2e626e035258/FLAG981bdc031 [2019-12-19 05:18:45,870 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:18:45,871 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_power.opt.i [2019-12-19 05:18:45,885 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb1435e/645139f787104b459cbb2e626e035258/FLAG981bdc031 [2019-12-19 05:18:46,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edcb1435e/645139f787104b459cbb2e626e035258 [2019-12-19 05:18:46,151 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:18:46,153 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:18:46,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:18:46,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:18:46,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:18:46,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:46,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5245d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46, skipping insertion in model container [2019-12-19 05:18:46,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:46,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:18:46,217 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:18:46,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:18:46,802 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:18:46,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:18:46,942 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:18:46,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46 WrapperNode [2019-12-19 05:18:46,943 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:18:46,943 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:18:46,944 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:18:46,944 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:18:46,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:46,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:47,012 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:18:47,013 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:18:47,013 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:18:47,013 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:18:47,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:47,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:47,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:47,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:47,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:47,041 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:47,045 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (1/1) ... [2019-12-19 05:18:47,050 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:18:47,051 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:18:47,051 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:18:47,051 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:18:47,052 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (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 05:18:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:18:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:18:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:18:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:18:47,131 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:18:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:18:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:18:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:18:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:18:47,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:18:47,132 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:18:47,134 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 05:18:47,893 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:18:47,893 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:18:47,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:18:47 BoogieIcfgContainer [2019-12-19 05:18:47,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:18:47,896 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:18:47,896 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:18:47,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:18:47,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:18:46" (1/3) ... [2019-12-19 05:18:47,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c15495b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:18:47, skipping insertion in model container [2019-12-19 05:18:47,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:18:46" (2/3) ... [2019-12-19 05:18:47,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c15495b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:18:47, skipping insertion in model container [2019-12-19 05:18:47,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:18:47" (3/3) ... [2019-12-19 05:18:47,903 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_power.opt.i [2019-12-19 05:18:47,914 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:18:47,915 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:18:47,922 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:18:47,923 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:18:47,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,959 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,960 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,961 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,964 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,966 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,967 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,967 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,968 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,968 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,968 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,969 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,970 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,981 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,981 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,984 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,985 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:47,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:18:48,003 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 05:18:48,024 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:18:48,024 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:18:48,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:18:48,025 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:18:48,025 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:18:48,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:18:48,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:18:48,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:18:48,040 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-19 05:18:49,441 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22493 states. [2019-12-19 05:18:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 22493 states. [2019-12-19 05:18:49,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-19 05:18:49,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:18:49,460 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] [2019-12-19 05:18:49,461 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:18:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:18:49,469 INFO L82 PathProgramCache]: Analyzing trace with hash -2054349026, now seen corresponding path program 1 times [2019-12-19 05:18:49,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:18:49,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756933024] [2019-12-19 05:18:49,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:18:49,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:18:49,798 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 05:18:49,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756933024] [2019-12-19 05:18:49,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:18:49,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:18:49,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240697687] [2019-12-19 05:18:49,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:18:49,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:18:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:18:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:18:49,825 INFO L87 Difference]: Start difference. First operand 22493 states. Second operand 4 states. [2019-12-19 05:18:50,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:18:50,960 INFO L93 Difference]: Finished difference Result 23445 states and 91746 transitions. [2019-12-19 05:18:50,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:18:50,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-19 05:18:50,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:18:51,157 INFO L225 Difference]: With dead ends: 23445 [2019-12-19 05:18:51,157 INFO L226 Difference]: Without dead ends: 21269 [2019-12-19 05:18:51,159 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 05:18:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21269 states. [2019-12-19 05:18:52,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21269 to 21269. [2019-12-19 05:18:52,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21269 states. [2019-12-19 05:18:52,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21269 states to 21269 states and 83770 transitions. [2019-12-19 05:18:52,328 INFO L78 Accepts]: Start accepts. Automaton has 21269 states and 83770 transitions. Word has length 36 [2019-12-19 05:18:52,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:18:52,329 INFO L462 AbstractCegarLoop]: Abstraction has 21269 states and 83770 transitions. [2019-12-19 05:18:52,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:18:52,329 INFO L276 IsEmpty]: Start isEmpty. Operand 21269 states and 83770 transitions. [2019-12-19 05:18:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-19 05:18:52,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:18:52,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:18:52,342 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:18:52,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:18:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 99870175, now seen corresponding path program 1 times [2019-12-19 05:18:52,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:18:52,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577823770] [2019-12-19 05:18:52,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:18:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:18:52,503 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 05:18:52,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577823770] [2019-12-19 05:18:52,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:18:52,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:18:52,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364591106] [2019-12-19 05:18:52,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:18:52,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:18:52,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:18:52,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:18:52,507 INFO L87 Difference]: Start difference. First operand 21269 states and 83770 transitions. Second operand 5 states. [2019-12-19 05:18:53,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:18:53,673 INFO L93 Difference]: Finished difference Result 34703 states and 129062 transitions. [2019-12-19 05:18:53,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:18:53,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-19 05:18:53,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:18:53,809 INFO L225 Difference]: With dead ends: 34703 [2019-12-19 05:18:53,809 INFO L226 Difference]: Without dead ends: 34559 [2019-12-19 05:18:53,810 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 05:18:55,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34559 states. [2019-12-19 05:18:56,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34559 to 33059. [2019-12-19 05:18:56,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33059 states. [2019-12-19 05:18:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33059 states to 33059 states and 123950 transitions. [2019-12-19 05:18:56,242 INFO L78 Accepts]: Start accepts. Automaton has 33059 states and 123950 transitions. Word has length 43 [2019-12-19 05:18:56,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:18:56,244 INFO L462 AbstractCegarLoop]: Abstraction has 33059 states and 123950 transitions. [2019-12-19 05:18:56,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:18:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 33059 states and 123950 transitions. [2019-12-19 05:18:56,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 05:18:56,248 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:18:56,248 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 05:18:56,249 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:18:56,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:18:56,249 INFO L82 PathProgramCache]: Analyzing trace with hash 268512672, now seen corresponding path program 1 times [2019-12-19 05:18:56,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:18:56,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563401464] [2019-12-19 05:18:56,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:18:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:18:56,337 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 05:18:56,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563401464] [2019-12-19 05:18:56,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:18:56,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:18:56,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201290919] [2019-12-19 05:18:56,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:18:56,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:18:56,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:18:56,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:18:56,340 INFO L87 Difference]: Start difference. First operand 33059 states and 123950 transitions. Second operand 5 states. [2019-12-19 05:18:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:18:56,899 INFO L93 Difference]: Finished difference Result 40211 states and 148619 transitions. [2019-12-19 05:18:56,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:18:56,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 05:18:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:18:58,513 INFO L225 Difference]: With dead ends: 40211 [2019-12-19 05:18:58,514 INFO L226 Difference]: Without dead ends: 40051 [2019-12-19 05:18:58,514 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 05:18:58,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40051 states. [2019-12-19 05:18:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40051 to 34632. [2019-12-19 05:18:59,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34632 states. [2019-12-19 05:18:59,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34632 states to 34632 states and 129246 transitions. [2019-12-19 05:18:59,797 INFO L78 Accepts]: Start accepts. Automaton has 34632 states and 129246 transitions. Word has length 44 [2019-12-19 05:18:59,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:18:59,797 INFO L462 AbstractCegarLoop]: Abstraction has 34632 states and 129246 transitions. [2019-12-19 05:18:59,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:18:59,798 INFO L276 IsEmpty]: Start isEmpty. Operand 34632 states and 129246 transitions. [2019-12-19 05:18:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 05:18:59,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:18:59,811 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] [2019-12-19 05:18:59,811 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:18:59,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:18:59,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2144969569, now seen corresponding path program 1 times [2019-12-19 05:18:59,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:18:59,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776596672] [2019-12-19 05:18:59,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:18:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:18:59,975 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 05:18:59,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776596672] [2019-12-19 05:18:59,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:18:59,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:18:59,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028965823] [2019-12-19 05:18:59,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:18:59,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:18:59,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:18:59,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:18:59,978 INFO L87 Difference]: Start difference. First operand 34632 states and 129246 transitions. Second operand 6 states. [2019-12-19 05:19:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:00,918 INFO L93 Difference]: Finished difference Result 45660 states and 166140 transitions. [2019-12-19 05:19:00,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:19:00,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-19 05:19:00,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:01,388 INFO L225 Difference]: With dead ends: 45660 [2019-12-19 05:19:01,388 INFO L226 Difference]: Without dead ends: 45516 [2019-12-19 05:19:01,389 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 05:19:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45516 states. [2019-12-19 05:19:04,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45516 to 33595. [2019-12-19 05:19:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33595 states. [2019-12-19 05:19:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33595 states to 33595 states and 125401 transitions. [2019-12-19 05:19:04,139 INFO L78 Accepts]: Start accepts. Automaton has 33595 states and 125401 transitions. Word has length 51 [2019-12-19 05:19:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:04,139 INFO L462 AbstractCegarLoop]: Abstraction has 33595 states and 125401 transitions. [2019-12-19 05:19:04,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 33595 states and 125401 transitions. [2019-12-19 05:19:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 05:19:04,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:04,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:04,171 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:04,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:04,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1490455740, now seen corresponding path program 1 times [2019-12-19 05:19:04,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:04,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322315905] [2019-12-19 05:19:04,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:04,265 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 05:19:04,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322315905] [2019-12-19 05:19:04,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:04,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:04,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380444639] [2019-12-19 05:19:04,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:04,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:04,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:04,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:04,268 INFO L87 Difference]: Start difference. First operand 33595 states and 125401 transitions. Second operand 6 states. [2019-12-19 05:19:04,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:04,969 INFO L93 Difference]: Finished difference Result 46067 states and 167834 transitions. [2019-12-19 05:19:04,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 05:19:04,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 05:19:04,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:05,091 INFO L225 Difference]: With dead ends: 46067 [2019-12-19 05:19:05,092 INFO L226 Difference]: Without dead ends: 45827 [2019-12-19 05:19:05,092 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 05:19:05,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45827 states. [2019-12-19 05:19:06,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45827 to 39956. [2019-12-19 05:19:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39956 states. [2019-12-19 05:19:06,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39956 states to 39956 states and 147325 transitions. [2019-12-19 05:19:06,318 INFO L78 Accepts]: Start accepts. Automaton has 39956 states and 147325 transitions. Word has length 58 [2019-12-19 05:19:06,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:06,319 INFO L462 AbstractCegarLoop]: Abstraction has 39956 states and 147325 transitions. [2019-12-19 05:19:06,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:06,319 INFO L276 IsEmpty]: Start isEmpty. Operand 39956 states and 147325 transitions. [2019-12-19 05:19:06,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:19:06,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:06,355 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] [2019-12-19 05:19:06,356 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:06,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1015725706, now seen corresponding path program 1 times [2019-12-19 05:19:06,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:06,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633256734] [2019-12-19 05:19:06,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:06,436 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 05:19:06,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633256734] [2019-12-19 05:19:06,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:06,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:06,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735467038] [2019-12-19 05:19:06,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:06,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:06,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:06,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:06,440 INFO L87 Difference]: Start difference. First operand 39956 states and 147325 transitions. Second operand 3 states. [2019-12-19 05:19:06,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:06,688 INFO L93 Difference]: Finished difference Result 50254 states and 182160 transitions. [2019-12-19 05:19:06,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:06,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-19 05:19:06,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:07,278 INFO L225 Difference]: With dead ends: 50254 [2019-12-19 05:19:07,279 INFO L226 Difference]: Without dead ends: 50254 [2019-12-19 05:19:07,279 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 05:19:07,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50254 states. [2019-12-19 05:19:08,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50254 to 43886. [2019-12-19 05:19:08,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43886 states. [2019-12-19 05:19:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43886 states to 43886 states and 160763 transitions. [2019-12-19 05:19:10,657 INFO L78 Accepts]: Start accepts. Automaton has 43886 states and 160763 transitions. Word has length 60 [2019-12-19 05:19:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:10,657 INFO L462 AbstractCegarLoop]: Abstraction has 43886 states and 160763 transitions. [2019-12-19 05:19:10,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 43886 states and 160763 transitions. [2019-12-19 05:19:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 05:19:10,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:10,693 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:10,693 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:10,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:10,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1067966230, now seen corresponding path program 1 times [2019-12-19 05:19:10,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:10,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681042985] [2019-12-19 05:19:10,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:10,795 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 05:19:10,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681042985] [2019-12-19 05:19:10,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:10,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:10,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849775631] [2019-12-19 05:19:10,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:10,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:10,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:10,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:10,798 INFO L87 Difference]: Start difference. First operand 43886 states and 160763 transitions. Second operand 7 states. [2019-12-19 05:19:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:11,851 INFO L93 Difference]: Finished difference Result 55882 states and 200497 transitions. [2019-12-19 05:19:11,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:19:11,851 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-19 05:19:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:11,970 INFO L225 Difference]: With dead ends: 55882 [2019-12-19 05:19:11,970 INFO L226 Difference]: Without dead ends: 55642 [2019-12-19 05:19:11,971 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 05:19:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55642 states. [2019-12-19 05:19:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55642 to 45112. [2019-12-19 05:19:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45112 states. [2019-12-19 05:19:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45112 states to 45112 states and 164930 transitions. [2019-12-19 05:19:13,072 INFO L78 Accepts]: Start accepts. Automaton has 45112 states and 164930 transitions. Word has length 64 [2019-12-19 05:19:13,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:13,072 INFO L462 AbstractCegarLoop]: Abstraction has 45112 states and 164930 transitions. [2019-12-19 05:19:13,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:13,072 INFO L276 IsEmpty]: Start isEmpty. Operand 45112 states and 164930 transitions. [2019-12-19 05:19:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:19:13,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:13,108 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 05:19:13,108 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:13,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:13,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2097396923, now seen corresponding path program 1 times [2019-12-19 05:19:13,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:13,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692236639] [2019-12-19 05:19:13,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:13,204 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 05:19:13,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692236639] [2019-12-19 05:19:13,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:13,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:13,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679911408] [2019-12-19 05:19:13,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:13,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:13,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:13,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:13,207 INFO L87 Difference]: Start difference. First operand 45112 states and 164930 transitions. Second operand 7 states. [2019-12-19 05:19:14,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:14,403 INFO L93 Difference]: Finished difference Result 55096 states and 197674 transitions. [2019-12-19 05:19:14,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:19:14,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 05:19:14,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:14,986 INFO L225 Difference]: With dead ends: 55096 [2019-12-19 05:19:14,986 INFO L226 Difference]: Without dead ends: 54896 [2019-12-19 05:19:14,987 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 05:19:15,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54896 states. [2019-12-19 05:19:15,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54896 to 45990. [2019-12-19 05:19:15,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45990 states. [2019-12-19 05:19:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45990 states to 45990 states and 167801 transitions. [2019-12-19 05:19:15,864 INFO L78 Accepts]: Start accepts. Automaton has 45990 states and 167801 transitions. Word has length 65 [2019-12-19 05:19:15,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:15,865 INFO L462 AbstractCegarLoop]: Abstraction has 45990 states and 167801 transitions. [2019-12-19 05:19:15,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:15,865 INFO L276 IsEmpty]: Start isEmpty. Operand 45990 states and 167801 transitions. [2019-12-19 05:19:15,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:19:15,899 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:15,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:15,900 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:15,900 INFO L82 PathProgramCache]: Analyzing trace with hash 823868575, now seen corresponding path program 1 times [2019-12-19 05:19:15,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:15,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186729721] [2019-12-19 05:19:15,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:16,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:19:16,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186729721] [2019-12-19 05:19:16,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:16,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:16,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445223707] [2019-12-19 05:19:16,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:16,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:16,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:16,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:16,481 INFO L87 Difference]: Start difference. First operand 45990 states and 167801 transitions. Second operand 6 states. [2019-12-19 05:19:17,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:17,306 INFO L93 Difference]: Finished difference Result 65550 states and 237328 transitions. [2019-12-19 05:19:17,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:17,307 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 05:19:17,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:17,448 INFO L225 Difference]: With dead ends: 65550 [2019-12-19 05:19:17,449 INFO L226 Difference]: Without dead ends: 64906 [2019-12-19 05:19:17,449 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 05:19:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64906 states. [2019-12-19 05:19:20,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64906 to 56040. [2019-12-19 05:19:20,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56040 states. [2019-12-19 05:19:20,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56040 states to 56040 states and 204331 transitions. [2019-12-19 05:19:20,490 INFO L78 Accepts]: Start accepts. Automaton has 56040 states and 204331 transitions. Word has length 67 [2019-12-19 05:19:20,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:20,491 INFO L462 AbstractCegarLoop]: Abstraction has 56040 states and 204331 transitions. [2019-12-19 05:19:20,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 56040 states and 204331 transitions. [2019-12-19 05:19:20,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:19:20,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:20,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:20,543 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:20,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:20,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1785482592, now seen corresponding path program 1 times [2019-12-19 05:19:20,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:20,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165394315] [2019-12-19 05:19:20,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:20,643 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 05:19:20,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165394315] [2019-12-19 05:19:20,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:20,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:20,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182923043] [2019-12-19 05:19:20,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:20,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:20,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:20,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:20,646 INFO L87 Difference]: Start difference. First operand 56040 states and 204331 transitions. Second operand 7 states. [2019-12-19 05:19:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:21,860 INFO L93 Difference]: Finished difference Result 83028 states and 292759 transitions. [2019-12-19 05:19:21,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:19:21,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 05:19:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:22,041 INFO L225 Difference]: With dead ends: 83028 [2019-12-19 05:19:22,041 INFO L226 Difference]: Without dead ends: 83028 [2019-12-19 05:19:22,042 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 05:19:22,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83028 states. [2019-12-19 05:19:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83028 to 76077. [2019-12-19 05:19:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76077 states. [2019-12-19 05:19:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76077 states to 76077 states and 270626 transitions. [2019-12-19 05:19:27,517 INFO L78 Accepts]: Start accepts. Automaton has 76077 states and 270626 transitions. Word has length 67 [2019-12-19 05:19:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:27,517 INFO L462 AbstractCegarLoop]: Abstraction has 76077 states and 270626 transitions. [2019-12-19 05:19:27,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 76077 states and 270626 transitions. [2019-12-19 05:19:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:19:27,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:27,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:27,596 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1264720223, now seen corresponding path program 1 times [2019-12-19 05:19:27,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:27,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645020916] [2019-12-19 05:19:27,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:27,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:27,711 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 05:19:27,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645020916] [2019-12-19 05:19:27,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:27,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:27,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675503849] [2019-12-19 05:19:27,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:27,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:27,714 INFO L87 Difference]: Start difference. First operand 76077 states and 270626 transitions. Second operand 5 states. [2019-12-19 05:19:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:27,847 INFO L93 Difference]: Finished difference Result 17222 states and 54504 transitions. [2019-12-19 05:19:27,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:19:27,847 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-19 05:19:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:27,884 INFO L225 Difference]: With dead ends: 17222 [2019-12-19 05:19:27,884 INFO L226 Difference]: Without dead ends: 16744 [2019-12-19 05:19:27,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 05:19:27,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16744 states. [2019-12-19 05:19:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16744 to 16732. [2019-12-19 05:19:28,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16732 states. [2019-12-19 05:19:28,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16732 states to 16732 states and 52999 transitions. [2019-12-19 05:19:28,229 INFO L78 Accepts]: Start accepts. Automaton has 16732 states and 52999 transitions. Word has length 67 [2019-12-19 05:19:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:28,229 INFO L462 AbstractCegarLoop]: Abstraction has 16732 states and 52999 transitions. [2019-12-19 05:19:28,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:28,230 INFO L276 IsEmpty]: Start isEmpty. Operand 16732 states and 52999 transitions. [2019-12-19 05:19:28,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:19:28,253 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:28,253 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:19:28,255 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:28,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:28,255 INFO L82 PathProgramCache]: Analyzing trace with hash -357405743, now seen corresponding path program 1 times [2019-12-19 05:19:28,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:28,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330908770] [2019-12-19 05:19:28,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:19:28,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330908770] [2019-12-19 05:19:28,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:28,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:28,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504050613] [2019-12-19 05:19:28,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:28,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:28,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:28,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:28,377 INFO L87 Difference]: Start difference. First operand 16732 states and 52999 transitions. Second operand 4 states. [2019-12-19 05:19:28,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:28,671 INFO L93 Difference]: Finished difference Result 22096 states and 69080 transitions. [2019-12-19 05:19:28,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:28,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-19 05:19:28,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:28,711 INFO L225 Difference]: With dead ends: 22096 [2019-12-19 05:19:28,711 INFO L226 Difference]: Without dead ends: 22096 [2019-12-19 05:19:28,712 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 05:19:28,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22096 states. [2019-12-19 05:19:28,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22096 to 17608. [2019-12-19 05:19:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17608 states. [2019-12-19 05:19:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17608 states to 17608 states and 55558 transitions. [2019-12-19 05:19:28,975 INFO L78 Accepts]: Start accepts. Automaton has 17608 states and 55558 transitions. Word has length 77 [2019-12-19 05:19:28,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:28,975 INFO L462 AbstractCegarLoop]: Abstraction has 17608 states and 55558 transitions. [2019-12-19 05:19:28,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:28,975 INFO L276 IsEmpty]: Start isEmpty. Operand 17608 states and 55558 transitions. [2019-12-19 05:19:28,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:19:28,988 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:28,988 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] [2019-12-19 05:19:28,989 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:28,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:28,989 INFO L82 PathProgramCache]: Analyzing trace with hash -612142288, now seen corresponding path program 1 times [2019-12-19 05:19:28,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:28,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278177241] [2019-12-19 05:19:28,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:29,097 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 05:19:29,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278177241] [2019-12-19 05:19:29,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:29,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:19:29,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898278622] [2019-12-19 05:19:29,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:19:29,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:19:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:19:29,099 INFO L87 Difference]: Start difference. First operand 17608 states and 55558 transitions. Second operand 8 states. [2019-12-19 05:19:30,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:30,295 INFO L93 Difference]: Finished difference Result 19702 states and 61634 transitions. [2019-12-19 05:19:30,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 05:19:30,296 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-19 05:19:30,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:30,326 INFO L225 Difference]: With dead ends: 19702 [2019-12-19 05:19:30,326 INFO L226 Difference]: Without dead ends: 19654 [2019-12-19 05:19:30,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-19 05:19:30,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19654 states. [2019-12-19 05:19:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19654 to 15526. [2019-12-19 05:19:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15526 states. [2019-12-19 05:19:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15526 states to 15526 states and 49292 transitions. [2019-12-19 05:19:30,740 INFO L78 Accepts]: Start accepts. Automaton has 15526 states and 49292 transitions. Word has length 77 [2019-12-19 05:19:30,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:30,741 INFO L462 AbstractCegarLoop]: Abstraction has 15526 states and 49292 transitions. [2019-12-19 05:19:30,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:19:30,741 INFO L276 IsEmpty]: Start isEmpty. Operand 15526 states and 49292 transitions. [2019-12-19 05:19:30,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 05:19:30,759 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:30,760 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 05:19:30,760 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2124522827, now seen corresponding path program 1 times [2019-12-19 05:19:30,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:30,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340737360] [2019-12-19 05:19:30,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:30,801 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 05:19:30,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340737360] [2019-12-19 05:19:30,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:30,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:30,803 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21064651] [2019-12-19 05:19:30,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:30,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:30,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:30,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:30,804 INFO L87 Difference]: Start difference. First operand 15526 states and 49292 transitions. Second operand 3 states. [2019-12-19 05:19:31,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:31,037 INFO L93 Difference]: Finished difference Result 16790 states and 53005 transitions. [2019-12-19 05:19:31,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:31,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-19 05:19:31,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:31,063 INFO L225 Difference]: With dead ends: 16790 [2019-12-19 05:19:31,063 INFO L226 Difference]: Without dead ends: 16790 [2019-12-19 05:19:31,063 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 05:19:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16790 states. [2019-12-19 05:19:31,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16790 to 16142. [2019-12-19 05:19:31,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16142 states. [2019-12-19 05:19:31,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16142 states to 16142 states and 51106 transitions. [2019-12-19 05:19:31,289 INFO L78 Accepts]: Start accepts. Automaton has 16142 states and 51106 transitions. Word has length 78 [2019-12-19 05:19:31,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:31,289 INFO L462 AbstractCegarLoop]: Abstraction has 16142 states and 51106 transitions. [2019-12-19 05:19:31,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 16142 states and 51106 transitions. [2019-12-19 05:19:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:19:31,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:31,304 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] [2019-12-19 05:19:31,304 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:31,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:31,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2047654897, now seen corresponding path program 1 times [2019-12-19 05:19:31,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:31,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292986306] [2019-12-19 05:19:31,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:31,351 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 05:19:31,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292986306] [2019-12-19 05:19:31,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:31,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:31,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834537511] [2019-12-19 05:19:31,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:31,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:31,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:31,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:31,353 INFO L87 Difference]: Start difference. First operand 16142 states and 51106 transitions. Second operand 4 states. [2019-12-19 05:19:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:31,698 INFO L93 Difference]: Finished difference Result 19270 states and 60152 transitions. [2019-12-19 05:19:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:19:31,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-19 05:19:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:31,733 INFO L225 Difference]: With dead ends: 19270 [2019-12-19 05:19:31,733 INFO L226 Difference]: Without dead ends: 19270 [2019-12-19 05:19:31,733 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 05:19:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19270 states. [2019-12-19 05:19:31,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19270 to 18247. [2019-12-19 05:19:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18247 states. [2019-12-19 05:19:31,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18247 states to 18247 states and 57268 transitions. [2019-12-19 05:19:31,988 INFO L78 Accepts]: Start accepts. Automaton has 18247 states and 57268 transitions. Word has length 79 [2019-12-19 05:19:31,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:31,988 INFO L462 AbstractCegarLoop]: Abstraction has 18247 states and 57268 transitions. [2019-12-19 05:19:31,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:31,988 INFO L276 IsEmpty]: Start isEmpty. Operand 18247 states and 57268 transitions. [2019-12-19 05:19:32,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:19:32,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:32,004 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] [2019-12-19 05:19:32,004 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:32,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash 111994610, now seen corresponding path program 1 times [2019-12-19 05:19:32,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:32,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073121806] [2019-12-19 05:19:32,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:32,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 05:19:32,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073121806] [2019-12-19 05:19:32,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:32,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:32,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833163263] [2019-12-19 05:19:32,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:32,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:32,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:32,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:32,048 INFO L87 Difference]: Start difference. First operand 18247 states and 57268 transitions. Second operand 3 states. [2019-12-19 05:19:32,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:32,337 INFO L93 Difference]: Finished difference Result 19578 states and 61167 transitions. [2019-12-19 05:19:32,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:32,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 05:19:32,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:32,367 INFO L225 Difference]: With dead ends: 19578 [2019-12-19 05:19:32,368 INFO L226 Difference]: Without dead ends: 19578 [2019-12-19 05:19:32,368 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 05:19:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19578 states. [2019-12-19 05:19:32,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19578 to 18919. [2019-12-19 05:19:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18919 states. [2019-12-19 05:19:32,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18919 states to 18919 states and 59232 transitions. [2019-12-19 05:19:32,826 INFO L78 Accepts]: Start accepts. Automaton has 18919 states and 59232 transitions. Word has length 79 [2019-12-19 05:19:32,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:32,826 INFO L462 AbstractCegarLoop]: Abstraction has 18919 states and 59232 transitions. [2019-12-19 05:19:32,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:32,826 INFO L276 IsEmpty]: Start isEmpty. Operand 18919 states and 59232 transitions. [2019-12-19 05:19:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:32,842 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:32,842 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] [2019-12-19 05:19:32,842 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:32,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:32,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1909076484, now seen corresponding path program 1 times [2019-12-19 05:19:32,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:32,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900394434] [2019-12-19 05:19:32,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:32,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:32,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:19:32,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900394434] [2019-12-19 05:19:32,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:32,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:32,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324083622] [2019-12-19 05:19:32,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:32,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:32,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:32,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:32,999 INFO L87 Difference]: Start difference. First operand 18919 states and 59232 transitions. Second operand 6 states. [2019-12-19 05:19:33,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:33,723 INFO L93 Difference]: Finished difference Result 30232 states and 93411 transitions. [2019-12-19 05:19:33,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:19:33,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:19:33,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:33,772 INFO L225 Difference]: With dead ends: 30232 [2019-12-19 05:19:33,772 INFO L226 Difference]: Without dead ends: 30232 [2019-12-19 05:19:33,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:19:33,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30232 states. [2019-12-19 05:19:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30232 to 21553. [2019-12-19 05:19:34,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21553 states. [2019-12-19 05:19:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21553 states to 21553 states and 66907 transitions. [2019-12-19 05:19:34,117 INFO L78 Accepts]: Start accepts. Automaton has 21553 states and 66907 transitions. Word has length 80 [2019-12-19 05:19:34,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:34,117 INFO L462 AbstractCegarLoop]: Abstraction has 21553 states and 66907 transitions. [2019-12-19 05:19:34,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 21553 states and 66907 transitions. [2019-12-19 05:19:34,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:34,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:34,135 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] [2019-12-19 05:19:34,135 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:34,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:34,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1141126331, now seen corresponding path program 1 times [2019-12-19 05:19:34,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:34,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446755800] [2019-12-19 05:19:34,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:34,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:34,196 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 05:19:34,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446755800] [2019-12-19 05:19:34,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:34,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:34,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130537853] [2019-12-19 05:19:34,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:34,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:34,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:34,199 INFO L87 Difference]: Start difference. First operand 21553 states and 66907 transitions. Second operand 4 states. [2019-12-19 05:19:34,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:34,860 INFO L93 Difference]: Finished difference Result 28569 states and 87453 transitions. [2019-12-19 05:19:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:34,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-19 05:19:34,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:34,903 INFO L225 Difference]: With dead ends: 28569 [2019-12-19 05:19:34,903 INFO L226 Difference]: Without dead ends: 28569 [2019-12-19 05:19:34,904 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 05:19:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28569 states. [2019-12-19 05:19:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28569 to 25906. [2019-12-19 05:19:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25906 states. [2019-12-19 05:19:35,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25906 states to 25906 states and 79893 transitions. [2019-12-19 05:19:35,271 INFO L78 Accepts]: Start accepts. Automaton has 25906 states and 79893 transitions. Word has length 80 [2019-12-19 05:19:35,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:35,271 INFO L462 AbstractCegarLoop]: Abstraction has 25906 states and 79893 transitions. [2019-12-19 05:19:35,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:35,271 INFO L276 IsEmpty]: Start isEmpty. Operand 25906 states and 79893 transitions. [2019-12-19 05:19:35,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:35,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:35,293 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] [2019-12-19 05:19:35,294 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:35,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:35,294 INFO L82 PathProgramCache]: Analyzing trace with hash -502495842, now seen corresponding path program 1 times [2019-12-19 05:19:35,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:35,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897449168] [2019-12-19 05:19:35,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:35,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:35,340 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 05:19:35,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897449168] [2019-12-19 05:19:35,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:35,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:35,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541216123] [2019-12-19 05:19:35,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:35,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:35,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:35,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:35,342 INFO L87 Difference]: Start difference. First operand 25906 states and 79893 transitions. Second operand 3 states. [2019-12-19 05:19:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:35,616 INFO L93 Difference]: Finished difference Result 24700 states and 74782 transitions. [2019-12-19 05:19:35,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:35,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 05:19:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:35,668 INFO L225 Difference]: With dead ends: 24700 [2019-12-19 05:19:35,668 INFO L226 Difference]: Without dead ends: 24700 [2019-12-19 05:19:35,668 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 05:19:35,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24700 states. [2019-12-19 05:19:35,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24700 to 23473. [2019-12-19 05:19:35,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23473 states. [2019-12-19 05:19:36,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23473 states to 23473 states and 71381 transitions. [2019-12-19 05:19:36,035 INFO L78 Accepts]: Start accepts. Automaton has 23473 states and 71381 transitions. Word has length 80 [2019-12-19 05:19:36,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:36,035 INFO L462 AbstractCegarLoop]: Abstraction has 23473 states and 71381 transitions. [2019-12-19 05:19:36,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:36,036 INFO L276 IsEmpty]: Start isEmpty. Operand 23473 states and 71381 transitions. [2019-12-19 05:19:36,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:36,057 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:36,057 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] [2019-12-19 05:19:36,058 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:36,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:36,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1017053084, now seen corresponding path program 1 times [2019-12-19 05:19:36,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:36,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576114607] [2019-12-19 05:19:36,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:36,156 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 05:19:36,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576114607] [2019-12-19 05:19:36,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:36,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:36,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108817238] [2019-12-19 05:19:36,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:36,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:36,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:36,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:36,158 INFO L87 Difference]: Start difference. First operand 23473 states and 71381 transitions. Second operand 6 states. [2019-12-19 05:19:36,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:36,613 INFO L93 Difference]: Finished difference Result 24021 states and 72777 transitions. [2019-12-19 05:19:36,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:36,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:19:36,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:36,646 INFO L225 Difference]: With dead ends: 24021 [2019-12-19 05:19:36,646 INFO L226 Difference]: Without dead ends: 24021 [2019-12-19 05:19:36,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:19:36,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24021 states. [2019-12-19 05:19:36,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24021 to 23419. [2019-12-19 05:19:36,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23419 states. [2019-12-19 05:19:36,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23419 states to 23419 states and 71162 transitions. [2019-12-19 05:19:36,964 INFO L78 Accepts]: Start accepts. Automaton has 23419 states and 71162 transitions. Word has length 80 [2019-12-19 05:19:36,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:36,964 INFO L462 AbstractCegarLoop]: Abstraction has 23419 states and 71162 transitions. [2019-12-19 05:19:36,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:36,964 INFO L276 IsEmpty]: Start isEmpty. Operand 23419 states and 71162 transitions. [2019-12-19 05:19:36,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:36,986 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:36,986 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] [2019-12-19 05:19:36,986 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:36,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:36,986 INFO L82 PathProgramCache]: Analyzing trace with hash 615750915, now seen corresponding path program 1 times [2019-12-19 05:19:36,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:36,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120634152] [2019-12-19 05:19:36,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:37,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:37,110 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 05:19:37,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120634152] [2019-12-19 05:19:37,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:37,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:37,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325945897] [2019-12-19 05:19:37,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:37,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:37,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:37,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:37,113 INFO L87 Difference]: Start difference. First operand 23419 states and 71162 transitions. Second operand 5 states. [2019-12-19 05:19:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:37,359 INFO L93 Difference]: Finished difference Result 23362 states and 70971 transitions. [2019-12-19 05:19:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:37,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:19:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:37,406 INFO L225 Difference]: With dead ends: 23362 [2019-12-19 05:19:37,406 INFO L226 Difference]: Without dead ends: 23362 [2019-12-19 05:19:37,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:37,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23362 states. [2019-12-19 05:19:37,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23362 to 23323. [2019-12-19 05:19:37,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23323 states. [2019-12-19 05:19:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23323 states to 23323 states and 70867 transitions. [2019-12-19 05:19:37,761 INFO L78 Accepts]: Start accepts. Automaton has 23323 states and 70867 transitions. Word has length 80 [2019-12-19 05:19:37,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:37,761 INFO L462 AbstractCegarLoop]: Abstraction has 23323 states and 70867 transitions. [2019-12-19 05:19:37,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:37,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23323 states and 70867 transitions. [2019-12-19 05:19:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:19:37,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:37,783 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] [2019-12-19 05:19:37,783 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:37,783 INFO L82 PathProgramCache]: Analyzing trace with hash 332600451, now seen corresponding path program 1 times [2019-12-19 05:19:37,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:37,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604646390] [2019-12-19 05:19:37,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:37,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:37,843 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 05:19:37,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604646390] [2019-12-19 05:19:37,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:37,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:37,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131343776] [2019-12-19 05:19:37,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:37,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:37,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:37,845 INFO L87 Difference]: Start difference. First operand 23323 states and 70867 transitions. Second operand 5 states. [2019-12-19 05:19:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:37,891 INFO L93 Difference]: Finished difference Result 3175 states and 7725 transitions. [2019-12-19 05:19:37,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:19:37,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:19:37,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:37,895 INFO L225 Difference]: With dead ends: 3175 [2019-12-19 05:19:37,895 INFO L226 Difference]: Without dead ends: 2657 [2019-12-19 05:19:37,895 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 05:19:37,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2657 states. [2019-12-19 05:19:37,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2657 to 2500. [2019-12-19 05:19:37,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2500 states. [2019-12-19 05:19:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 6046 transitions. [2019-12-19 05:19:37,925 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 6046 transitions. Word has length 80 [2019-12-19 05:19:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:37,925 INFO L462 AbstractCegarLoop]: Abstraction has 2500 states and 6046 transitions. [2019-12-19 05:19:37,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:37,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 6046 transitions. [2019-12-19 05:19:38,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:38,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:38,076 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] [2019-12-19 05:19:38,076 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:38,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:38,076 INFO L82 PathProgramCache]: Analyzing trace with hash -972148400, now seen corresponding path program 1 times [2019-12-19 05:19:38,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:38,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487982974] [2019-12-19 05:19:38,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:38,159 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 05:19:38,162 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487982974] [2019-12-19 05:19:38,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:38,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:38,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743944258] [2019-12-19 05:19:38,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:38,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:38,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:38,167 INFO L87 Difference]: Start difference. First operand 2500 states and 6046 transitions. Second operand 5 states. [2019-12-19 05:19:38,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:38,392 INFO L93 Difference]: Finished difference Result 2838 states and 6804 transitions. [2019-12-19 05:19:38,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:38,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:19:38,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:38,397 INFO L225 Difference]: With dead ends: 2838 [2019-12-19 05:19:38,397 INFO L226 Difference]: Without dead ends: 2838 [2019-12-19 05:19:38,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 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 05:19:38,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2838 states. [2019-12-19 05:19:38,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2838 to 2578. [2019-12-19 05:19:38,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2578 states. [2019-12-19 05:19:38,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2578 states to 2578 states and 6210 transitions. [2019-12-19 05:19:38,436 INFO L78 Accepts]: Start accepts. Automaton has 2578 states and 6210 transitions. Word has length 92 [2019-12-19 05:19:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:38,436 INFO L462 AbstractCegarLoop]: Abstraction has 2578 states and 6210 transitions. [2019-12-19 05:19:38,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:38,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2578 states and 6210 transitions. [2019-12-19 05:19:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:38,440 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:38,440 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] [2019-12-19 05:19:38,440 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:38,441 INFO L82 PathProgramCache]: Analyzing trace with hash 38995794, now seen corresponding path program 1 times [2019-12-19 05:19:38,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:38,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742537097] [2019-12-19 05:19:38,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:19:38,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742537097] [2019-12-19 05:19:38,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:38,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:38,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132032952] [2019-12-19 05:19:38,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:38,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:38,590 INFO L87 Difference]: Start difference. First operand 2578 states and 6210 transitions. Second operand 7 states. [2019-12-19 05:19:38,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:38,987 INFO L93 Difference]: Finished difference Result 2374 states and 5670 transitions. [2019-12-19 05:19:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:38,988 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:19:38,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:38,991 INFO L225 Difference]: With dead ends: 2374 [2019-12-19 05:19:38,992 INFO L226 Difference]: Without dead ends: 2374 [2019-12-19 05:19:38,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:19:38,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2374 states. [2019-12-19 05:19:39,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2374 to 2305. [2019-12-19 05:19:39,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2305 states. [2019-12-19 05:19:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 5525 transitions. [2019-12-19 05:19:39,015 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 5525 transitions. Word has length 92 [2019-12-19 05:19:39,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:39,015 INFO L462 AbstractCegarLoop]: Abstraction has 2305 states and 5525 transitions. [2019-12-19 05:19:39,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:39,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 5525 transitions. [2019-12-19 05:19:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:39,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:39,017 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] [2019-12-19 05:19:39,018 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:39,018 INFO L82 PathProgramCache]: Analyzing trace with hash -869143036, now seen corresponding path program 1 times [2019-12-19 05:19:39,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:39,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077607628] [2019-12-19 05:19:39,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:39,224 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 05:19:39,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077607628] [2019-12-19 05:19:39,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:39,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:39,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601149336] [2019-12-19 05:19:39,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:39,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:39,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:39,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:39,226 INFO L87 Difference]: Start difference. First operand 2305 states and 5525 transitions. Second operand 6 states. [2019-12-19 05:19:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:39,344 INFO L93 Difference]: Finished difference Result 2566 states and 6034 transitions. [2019-12-19 05:19:39,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:19:39,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:19:39,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:39,348 INFO L225 Difference]: With dead ends: 2566 [2019-12-19 05:19:39,348 INFO L226 Difference]: Without dead ends: 2538 [2019-12-19 05:19:39,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2019-12-19 05:19:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2332. [2019-12-19 05:19:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2332 states. [2019-12-19 05:19:39,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2332 states to 2332 states and 5556 transitions. [2019-12-19 05:19:39,384 INFO L78 Accepts]: Start accepts. Automaton has 2332 states and 5556 transitions. Word has length 92 [2019-12-19 05:19:39,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:39,385 INFO L462 AbstractCegarLoop]: Abstraction has 2332 states and 5556 transitions. [2019-12-19 05:19:39,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:39,385 INFO L276 IsEmpty]: Start isEmpty. Operand 2332 states and 5556 transitions. [2019-12-19 05:19:39,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:39,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:39,388 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] [2019-12-19 05:19:39,388 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:39,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:39,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1404367329, now seen corresponding path program 1 times [2019-12-19 05:19:39,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:39,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51605863] [2019-12-19 05:19:39,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:39,488 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 05:19:39,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51605863] [2019-12-19 05:19:39,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:39,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:39,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990476365] [2019-12-19 05:19:39,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:39,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:39,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:39,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:39,491 INFO L87 Difference]: Start difference. First operand 2332 states and 5556 transitions. Second operand 6 states. [2019-12-19 05:19:39,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:39,835 INFO L93 Difference]: Finished difference Result 4292 states and 10403 transitions. [2019-12-19 05:19:39,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:19:39,836 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:19:39,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:39,844 INFO L225 Difference]: With dead ends: 4292 [2019-12-19 05:19:39,845 INFO L226 Difference]: Without dead ends: 4292 [2019-12-19 05:19:39,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:39,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4292 states. [2019-12-19 05:19:39,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4292 to 2347. [2019-12-19 05:19:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2347 states. [2019-12-19 05:19:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2347 states to 2347 states and 5591 transitions. [2019-12-19 05:19:39,907 INFO L78 Accepts]: Start accepts. Automaton has 2347 states and 5591 transitions. Word has length 92 [2019-12-19 05:19:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:39,908 INFO L462 AbstractCegarLoop]: Abstraction has 2347 states and 5591 transitions. [2019-12-19 05:19:39,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:39,908 INFO L276 IsEmpty]: Start isEmpty. Operand 2347 states and 5591 transitions. [2019-12-19 05:19:39,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:39,911 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:39,911 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] [2019-12-19 05:19:39,912 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:39,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1528440576, now seen corresponding path program 1 times [2019-12-19 05:19:39,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:39,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965674908] [2019-12-19 05:19:39,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:40,084 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 05:19:40,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965674908] [2019-12-19 05:19:40,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:40,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:40,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583853771] [2019-12-19 05:19:40,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:40,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:40,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:40,088 INFO L87 Difference]: Start difference. First operand 2347 states and 5591 transitions. Second operand 7 states. [2019-12-19 05:19:40,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:40,568 INFO L93 Difference]: Finished difference Result 3281 states and 7693 transitions. [2019-12-19 05:19:40,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:19:40,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:19:40,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:40,573 INFO L225 Difference]: With dead ends: 3281 [2019-12-19 05:19:40,573 INFO L226 Difference]: Without dead ends: 3245 [2019-12-19 05:19:40,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:19:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3245 states. [2019-12-19 05:19:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3245 to 2665. [2019-12-19 05:19:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2665 states. [2019-12-19 05:19:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 6299 transitions. [2019-12-19 05:19:40,619 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 6299 transitions. Word has length 92 [2019-12-19 05:19:40,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:40,619 INFO L462 AbstractCegarLoop]: Abstraction has 2665 states and 6299 transitions. [2019-12-19 05:19:40,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:40,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 6299 transitions. [2019-12-19 05:19:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:40,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:40,624 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] [2019-12-19 05:19:40,624 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:40,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:40,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1245290112, now seen corresponding path program 1 times [2019-12-19 05:19:40,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:40,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940445974] [2019-12-19 05:19:40,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:40,727 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 05:19:40,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940445974] [2019-12-19 05:19:40,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:40,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:19:40,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36628260] [2019-12-19 05:19:40,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:19:40,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:40,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:19:40,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:40,729 INFO L87 Difference]: Start difference. First operand 2665 states and 6299 transitions. Second operand 7 states. [2019-12-19 05:19:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:41,138 INFO L93 Difference]: Finished difference Result 3529 states and 8309 transitions. [2019-12-19 05:19:41,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:41,138 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:19:41,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:41,143 INFO L225 Difference]: With dead ends: 3529 [2019-12-19 05:19:41,143 INFO L226 Difference]: Without dead ends: 3529 [2019-12-19 05:19:41,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:19:41,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2019-12-19 05:19:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2901. [2019-12-19 05:19:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2901 states. [2019-12-19 05:19:41,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2901 states to 2901 states and 6889 transitions. [2019-12-19 05:19:41,187 INFO L78 Accepts]: Start accepts. Automaton has 2901 states and 6889 transitions. Word has length 92 [2019-12-19 05:19:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:41,188 INFO L462 AbstractCegarLoop]: Abstraction has 2901 states and 6889 transitions. [2019-12-19 05:19:41,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:19:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 2901 states and 6889 transitions. [2019-12-19 05:19:41,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:19:41,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:41,192 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] [2019-12-19 05:19:41,192 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:41,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:41,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1804912703, now seen corresponding path program 1 times [2019-12-19 05:19:41,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:41,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566518623] [2019-12-19 05:19:41,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:41,245 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 05:19:41,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566518623] [2019-12-19 05:19:41,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:41,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:19:41,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262124747] [2019-12-19 05:19:41,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:19:41,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:41,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:19:41,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:19:41,247 INFO L87 Difference]: Start difference. First operand 2901 states and 6889 transitions. Second operand 3 states. [2019-12-19 05:19:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:41,310 INFO L93 Difference]: Finished difference Result 2739 states and 6403 transitions. [2019-12-19 05:19:41,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:19:41,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-12-19 05:19:41,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:41,315 INFO L225 Difference]: With dead ends: 2739 [2019-12-19 05:19:41,315 INFO L226 Difference]: Without dead ends: 2721 [2019-12-19 05:19:41,317 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 05:19:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2721 states. [2019-12-19 05:19:41,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2721 to 2335. [2019-12-19 05:19:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2335 states. [2019-12-19 05:19:41,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2335 states to 2335 states and 5471 transitions. [2019-12-19 05:19:41,350 INFO L78 Accepts]: Start accepts. Automaton has 2335 states and 5471 transitions. Word has length 92 [2019-12-19 05:19:41,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:41,351 INFO L462 AbstractCegarLoop]: Abstraction has 2335 states and 5471 transitions. [2019-12-19 05:19:41,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:19:41,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2335 states and 5471 transitions. [2019-12-19 05:19:41,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:41,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:41,354 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] [2019-12-19 05:19:41,354 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash -436198428, now seen corresponding path program 1 times [2019-12-19 05:19:41,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:41,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719625764] [2019-12-19 05:19:41,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:41,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:41,451 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 05:19:41,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719625764] [2019-12-19 05:19:41,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:41,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:41,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275268798] [2019-12-19 05:19:41,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:41,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:41,454 INFO L87 Difference]: Start difference. First operand 2335 states and 5471 transitions. Second operand 6 states. [2019-12-19 05:19:41,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:41,647 INFO L93 Difference]: Finished difference Result 2575 states and 5940 transitions. [2019-12-19 05:19:41,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:19:41,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 05:19:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:41,653 INFO L225 Difference]: With dead ends: 2575 [2019-12-19 05:19:41,653 INFO L226 Difference]: Without dead ends: 2575 [2019-12-19 05:19:41,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:19:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-19 05:19:41,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2395. [2019-12-19 05:19:41,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2019-12-19 05:19:41,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 5582 transitions. [2019-12-19 05:19:41,698 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 5582 transitions. Word has length 94 [2019-12-19 05:19:41,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:41,699 INFO L462 AbstractCegarLoop]: Abstraction has 2395 states and 5582 transitions. [2019-12-19 05:19:41,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:41,699 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 5582 transitions. [2019-12-19 05:19:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:41,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:41,703 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] [2019-12-19 05:19:41,704 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:41,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:41,704 INFO L82 PathProgramCache]: Analyzing trace with hash -106432667, now seen corresponding path program 1 times [2019-12-19 05:19:41,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:41,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764184123] [2019-12-19 05:19:41,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:41,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:41,759 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 05:19:41,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764184123] [2019-12-19 05:19:41,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:41,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:41,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766885512] [2019-12-19 05:19:41,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:41,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:41,761 INFO L87 Difference]: Start difference. First operand 2395 states and 5582 transitions. Second operand 4 states. [2019-12-19 05:19:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:41,841 INFO L93 Difference]: Finished difference Result 2395 states and 5546 transitions. [2019-12-19 05:19:41,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:41,841 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-12-19 05:19:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:41,845 INFO L225 Difference]: With dead ends: 2395 [2019-12-19 05:19:41,845 INFO L226 Difference]: Without dead ends: 2395 [2019-12-19 05:19:41,846 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 05:19:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2395 states. [2019-12-19 05:19:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2395 to 1922. [2019-12-19 05:19:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1922 states. [2019-12-19 05:19:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1922 states to 1922 states and 4532 transitions. [2019-12-19 05:19:41,875 INFO L78 Accepts]: Start accepts. Automaton has 1922 states and 4532 transitions. Word has length 94 [2019-12-19 05:19:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:41,875 INFO L462 AbstractCegarLoop]: Abstraction has 1922 states and 4532 transitions. [2019-12-19 05:19:41,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1922 states and 4532 transitions. [2019-12-19 05:19:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:41,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:41,878 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:41,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:41,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1154922491, now seen corresponding path program 1 times [2019-12-19 05:19:41,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:41,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676041782] [2019-12-19 05:19:41,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:41,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:41,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:19:41,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676041782] [2019-12-19 05:19:41,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:41,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:41,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308113296] [2019-12-19 05:19:41,947 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:41,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:41,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:41,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:41,948 INFO L87 Difference]: Start difference. First operand 1922 states and 4532 transitions. Second operand 5 states. [2019-12-19 05:19:42,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:42,146 INFO L93 Difference]: Finished difference Result 2174 states and 5111 transitions. [2019-12-19 05:19:42,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:19:42,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:19:42,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:42,150 INFO L225 Difference]: With dead ends: 2174 [2019-12-19 05:19:42,150 INFO L226 Difference]: Without dead ends: 2156 [2019-12-19 05:19:42,151 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 05:19:42,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2156 states. [2019-12-19 05:19:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2156 to 1949. [2019-12-19 05:19:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1949 states. [2019-12-19 05:19:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1949 states to 1949 states and 4586 transitions. [2019-12-19 05:19:42,172 INFO L78 Accepts]: Start accepts. Automaton has 1949 states and 4586 transitions. Word has length 94 [2019-12-19 05:19:42,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:42,172 INFO L462 AbstractCegarLoop]: Abstraction has 1949 states and 4586 transitions. [2019-12-19 05:19:42,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:42,172 INFO L276 IsEmpty]: Start isEmpty. Operand 1949 states and 4586 transitions. [2019-12-19 05:19:42,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:42,174 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:42,174 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] [2019-12-19 05:19:42,174 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:42,175 INFO L82 PathProgramCache]: Analyzing trace with hash 89841990, now seen corresponding path program 1 times [2019-12-19 05:19:42,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:42,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615094811] [2019-12-19 05:19:42,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:42,270 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 05:19:42,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615094811] [2019-12-19 05:19:42,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:42,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:19:42,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356459692] [2019-12-19 05:19:42,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:19:42,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:42,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:19:42,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:19:42,272 INFO L87 Difference]: Start difference. First operand 1949 states and 4586 transitions. Second operand 6 states. [2019-12-19 05:19:42,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:42,338 INFO L93 Difference]: Finished difference Result 3109 states and 7432 transitions. [2019-12-19 05:19:42,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:19:42,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-12-19 05:19:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:42,340 INFO L225 Difference]: With dead ends: 3109 [2019-12-19 05:19:42,340 INFO L226 Difference]: Without dead ends: 1229 [2019-12-19 05:19:42,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:19:42,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-12-19 05:19:42,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2019-12-19 05:19:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-12-19 05:19:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2953 transitions. [2019-12-19 05:19:42,359 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 2953 transitions. Word has length 94 [2019-12-19 05:19:42,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:42,359 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 2953 transitions. [2019-12-19 05:19:42,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:19:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2953 transitions. [2019-12-19 05:19:42,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:42,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:42,362 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] [2019-12-19 05:19:42,362 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:42,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:42,362 INFO L82 PathProgramCache]: Analyzing trace with hash 373162808, now seen corresponding path program 1 times [2019-12-19 05:19:42,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:42,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742376770] [2019-12-19 05:19:42,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:42,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:42,434 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 05:19:42,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742376770] [2019-12-19 05:19:42,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:42,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:42,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676835583] [2019-12-19 05:19:42,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:42,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:42,436 INFO L87 Difference]: Start difference. First operand 1229 states and 2953 transitions. Second operand 5 states. [2019-12-19 05:19:42,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:42,825 INFO L93 Difference]: Finished difference Result 3090 states and 7647 transitions. [2019-12-19 05:19:42,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:19:42,825 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:19:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:42,829 INFO L225 Difference]: With dead ends: 3090 [2019-12-19 05:19:42,829 INFO L226 Difference]: Without dead ends: 3090 [2019-12-19 05:19:42,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:19:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3090 states. [2019-12-19 05:19:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3090 to 1221. [2019-12-19 05:19:42,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1221 states. [2019-12-19 05:19:42,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 2937 transitions. [2019-12-19 05:19:42,853 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 2937 transitions. Word has length 94 [2019-12-19 05:19:42,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:42,854 INFO L462 AbstractCegarLoop]: Abstraction has 1221 states and 2937 transitions. [2019-12-19 05:19:42,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:42,854 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 2937 transitions. [2019-12-19 05:19:42,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:42,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:42,855 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] [2019-12-19 05:19:42,855 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:42,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:42,855 INFO L82 PathProgramCache]: Analyzing trace with hash 104916029, now seen corresponding path program 1 times [2019-12-19 05:19:42,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:42,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181956954] [2019-12-19 05:19:42,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:42,938 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 05:19:42,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181956954] [2019-12-19 05:19:42,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:42,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:42,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289915754] [2019-12-19 05:19:42,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:42,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:42,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:42,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:42,940 INFO L87 Difference]: Start difference. First operand 1221 states and 2937 transitions. Second operand 5 states. [2019-12-19 05:19:42,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:42,980 INFO L93 Difference]: Finished difference Result 1221 states and 2902 transitions. [2019-12-19 05:19:42,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:19:42,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:19:42,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:42,982 INFO L225 Difference]: With dead ends: 1221 [2019-12-19 05:19:42,982 INFO L226 Difference]: Without dead ends: 1221 [2019-12-19 05:19:42,982 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 05:19:42,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2019-12-19 05:19:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 1181. [2019-12-19 05:19:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1181 states. [2019-12-19 05:19:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 2826 transitions. [2019-12-19 05:19:42,998 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 2826 transitions. Word has length 94 [2019-12-19 05:19:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:42,999 INFO L462 AbstractCegarLoop]: Abstraction has 1181 states and 2826 transitions. [2019-12-19 05:19:42,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 2826 transitions. [2019-12-19 05:19:43,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:43,001 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:43,001 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] [2019-12-19 05:19:43,001 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:43,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:43,001 INFO L82 PathProgramCache]: Analyzing trace with hash -919777892, now seen corresponding path program 2 times [2019-12-19 05:19:43,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:43,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876121522] [2019-12-19 05:19:43,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:43,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:43,129 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 05:19:43,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876121522] [2019-12-19 05:19:43,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:43,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 05:19:43,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201300553] [2019-12-19 05:19:43,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 05:19:43,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:43,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 05:19:43,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:19:43,131 INFO L87 Difference]: Start difference. First operand 1181 states and 2826 transitions. Second operand 11 states. [2019-12-19 05:19:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:43,424 INFO L93 Difference]: Finished difference Result 2271 states and 5486 transitions. [2019-12-19 05:19:43,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:19:43,424 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-19 05:19:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:43,427 INFO L225 Difference]: With dead ends: 2271 [2019-12-19 05:19:43,427 INFO L226 Difference]: Without dead ends: 1632 [2019-12-19 05:19:43,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 05:19:43,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1632 states. [2019-12-19 05:19:43,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1632 to 1534. [2019-12-19 05:19:43,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1534 states. [2019-12-19 05:19:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1534 states to 1534 states and 3570 transitions. [2019-12-19 05:19:43,443 INFO L78 Accepts]: Start accepts. Automaton has 1534 states and 3570 transitions. Word has length 94 [2019-12-19 05:19:43,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:43,443 INFO L462 AbstractCegarLoop]: Abstraction has 1534 states and 3570 transitions. [2019-12-19 05:19:43,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 05:19:43,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1534 states and 3570 transitions. [2019-12-19 05:19:43,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:19:43,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:43,445 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] [2019-12-19 05:19:43,445 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:43,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:43,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1370490878, now seen corresponding path program 3 times [2019-12-19 05:19:43,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:43,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672935213] [2019-12-19 05:19:43,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:19:43,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:19:43,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:19:43,532 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:19:43,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:19:43 BasicIcfg [2019-12-19 05:19:43,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:19:43,704 INFO L168 Benchmark]: Toolchain (without parser) took 57551.32 ms. Allocated memory was 141.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 97.1 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 723.9 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:43,705 INFO L168 Benchmark]: CDTParser took 0.54 ms. Allocated memory is still 141.0 MB. Free memory was 117.4 MB in the beginning and 117.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 05:19:43,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 787.49 ms. Allocated memory was 141.0 MB in the beginning and 198.2 MB in the end (delta: 57.1 MB). Free memory was 96.9 MB in the beginning and 152.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:43,706 INFO L168 Benchmark]: Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 198.2 MB. Free memory was 152.2 MB in the beginning and 149.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:43,706 INFO L168 Benchmark]: Boogie Preprocessor took 37.78 ms. Allocated memory is still 198.2 MB. Free memory was 149.4 MB in the beginning and 147.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:43,706 INFO L168 Benchmark]: RCFGBuilder took 843.98 ms. Allocated memory is still 198.2 MB. Free memory was 147.3 MB in the beginning and 103.1 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:43,707 INFO L168 Benchmark]: TraceAbstraction took 55806.29 ms. Allocated memory was 198.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 102.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 672.1 MB. Max. memory is 7.1 GB. [2019-12-19 05:19:43,708 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.54 ms. Allocated memory is still 141.0 MB. Free memory was 117.4 MB in the beginning and 117.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 787.49 ms. Allocated memory was 141.0 MB in the beginning and 198.2 MB in the end (delta: 57.1 MB). Free memory was 96.9 MB in the beginning and 152.2 MB in the end (delta: -55.4 MB). Peak memory consumption was 22.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 69.02 ms. Allocated memory is still 198.2 MB. Free memory was 152.2 MB in the beginning and 149.4 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.78 ms. Allocated memory is still 198.2 MB. Free memory was 149.4 MB in the beginning and 147.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 843.98 ms. Allocated memory is still 198.2 MB. Free memory was 147.3 MB in the beginning and 103.1 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55806.29 ms. Allocated memory was 198.2 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 102.4 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 672.1 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] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L699] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L700] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L701] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L702] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L703] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L704] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L705] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L706] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L707] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L708] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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}] [L709] 0 int x$w_buff0; VAL [__unbuffered_cnt=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] [L710] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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] [L711] 0 int x$w_buff1; VAL [__unbuffered_cnt=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] [L712] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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] [L714] 0 int y = 0; VAL [__unbuffered_cnt=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] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L776] 0 pthread_t t2475; VAL [__unbuffered_cnt=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] [L777] FCALL, FORK 0 pthread_create(&t2475, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L778] 0 pthread_t t2476; VAL [__unbuffered_cnt=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] [L779] FCALL, FORK 0 pthread_create(&t2476, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L740] 2 x$w_buff1 = x$w_buff0 [L741] 2 x$w_buff0 = 2 [L742] 2 x$w_buff1_used = x$w_buff0_used [L743] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=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] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=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=1] [L754] 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, 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=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=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=2] [L754] 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) [L755] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=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=2] [L726] 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, 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=2] [L726] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=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, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 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, 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 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 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) [L727] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=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$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 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, 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 || 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=2] [L728] 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 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=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=2] [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L730] 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=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 || 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=2] [L730] 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 [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, 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=2] [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] 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=1, 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=2] [L756] 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 [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, 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=2] [L757] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] 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=1, 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=2] [L758] 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 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, 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=2] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, 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=2] [L785] 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, 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=2] [L785] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, 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=2] [L785] 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, 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=2] [L785] 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) [L786] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, 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=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 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, 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=2] [L787] 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 [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, 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=2] [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 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, 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=2] [L789] 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 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, 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=2] [L796] 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, 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=2] [L796] 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) [L797] 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, 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=2] [L797] 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)) [L798] 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, 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=2] [L798] 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)) [L799] 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, 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=2] [L799] 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)) [L800] 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, 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=2] [L800] 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)) [L801] 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, 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=2] [L801] 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)) [L802] 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, 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=2] [L802] 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)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, 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=2] [L804] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, 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=2] [L804] 0 x = x$flush_delayed ? x$mem_tmp : x [L805] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, 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=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, 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=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 55.5s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9037 SDtfs, 8844 SDslu, 19471 SDs, 0 SdLazy, 8462 SolverSat, 541 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 106 SyntacticMatches, 23 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76077occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 26.8s AutomataMinimizationTime, 36 MinimizatonAttempts, 97598 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2888 NumberOfCodeBlocks, 2888 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2758 ConstructedInterpolants, 0 QuantifiedInterpolants, 514060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...