/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_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:20:50,849 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:20:50,851 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:20:50,872 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:20:50,872 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:20:50,874 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:20:50,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:20:50,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:20:50,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:20:50,890 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:20:50,894 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:20:50,895 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:20:50,895 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:20:50,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:20:50,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:20:50,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:20:50,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:20:50,906 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:20:50,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:20:50,914 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:20:50,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:20:50,922 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:20:50,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:20:50,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:20:50,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:20:50,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:20:50,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:20:50,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:20:50,931 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:20:50,932 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:20:50,932 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:20:50,933 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:20:50,934 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:20:50,935 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:20:50,936 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:20:50,937 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:20:50,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:20:50,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:20:50,938 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:20:50,940 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:20:50,941 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:20:50,943 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:20:50,977 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:20:50,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:20:50,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:20:50,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:20:50,979 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:20:50,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:20:50,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:20:50,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:20:50,980 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:20:50,980 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:20:50,980 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:20:50,980 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:20:50,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:20:50,981 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:20:50,981 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:20:50,981 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:20:50,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:20:50,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:20:50,984 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:20:50,984 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:20:50,984 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:20:50,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:20:50,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:20:50,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:20:50,985 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:20:50,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:20:50,986 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:20:50,986 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:20:50,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:20:50,986 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:20:51,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:20:51,295 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:20:51,300 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:20:51,302 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:20:51,302 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:20:51,304 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-19 05:20:51,367 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9f9f0af/049ae06c481f48349a7b408fb6c45cf0/FLAG7afaf5f1c [2019-12-19 05:20:51,966 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:20:51,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2019-12-19 05:20:51,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9f9f0af/049ae06c481f48349a7b408fb6c45cf0/FLAG7afaf5f1c [2019-12-19 05:20:52,245 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c9f9f0af/049ae06c481f48349a7b408fb6c45cf0 [2019-12-19 05:20:52,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:20:52,256 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:20:52,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:20:52,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:20:52,260 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:20:52,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:20:52" (1/1) ... [2019-12-19 05:20:52,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e483e06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:52, skipping insertion in model container [2019-12-19 05:20:52,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:20:52" (1/1) ... [2019-12-19 05:20:52,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:20:52,333 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:20:52,894 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:20:52,910 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:20:52,967 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:20:53,065 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:20:53,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53 WrapperNode [2019-12-19 05:20:53,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:20:53,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:20:53,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:20:53,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:20:53,073 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:20:53" (1/1) ... [2019-12-19 05:20:53,091 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:20:53" (1/1) ... [2019-12-19 05:20:53,126 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:20:53,127 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:20:53,127 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:20:53,127 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:20:53,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,153 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (1/1) ... [2019-12-19 05:20:53,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:20:53,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:20:53,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:20:53,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:20:53,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (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:20:53,236 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:20:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:20:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:20:53,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:20:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:20:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:20:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:20:53,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:20:53,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:20:53,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:20:53,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:20:53,240 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:20:53,904 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:20:53,905 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:20:53,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:20:53 BoogieIcfgContainer [2019-12-19 05:20:53,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:20:53,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:20:53,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:20:53,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:20:53,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:20:52" (1/3) ... [2019-12-19 05:20:53,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362b621f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:20:53, skipping insertion in model container [2019-12-19 05:20:53,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:20:53" (2/3) ... [2019-12-19 05:20:53,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@362b621f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:20:53, skipping insertion in model container [2019-12-19 05:20:53,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:20:53" (3/3) ... [2019-12-19 05:20:53,915 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2019-12-19 05:20:53,926 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:20:53,926 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:20:53,934 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:20:53,935 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:20:53,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,971 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,972 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,972 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,973 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,973 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,974 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,975 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,976 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,977 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,978 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,979 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,980 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,981 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,984 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,985 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,986 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,987 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,988 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,994 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,995 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:53,999 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:20:54,017 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 05:20:54,037 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:20:54,037 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:20:54,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:20:54,038 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:20:54,038 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:20:54,038 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:20:54,038 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:20:54,038 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:20:54,052 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-19 05:20:55,379 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22509 states. [2019-12-19 05:20:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 22509 states. [2019-12-19 05:20:55,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-19 05:20:55,388 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:55,389 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] [2019-12-19 05:20:55,390 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:55,397 INFO L82 PathProgramCache]: Analyzing trace with hash -641553760, now seen corresponding path program 1 times [2019-12-19 05:20:55,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:55,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898391294] [2019-12-19 05:20:55,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:55,689 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:20:55,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898391294] [2019-12-19 05:20:55,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:55,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:55,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430491569] [2019-12-19 05:20:55,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:55,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:55,719 INFO L87 Difference]: Start difference. First operand 22509 states. Second operand 4 states. [2019-12-19 05:20:56,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:56,495 INFO L93 Difference]: Finished difference Result 23453 states and 91770 transitions. [2019-12-19 05:20:56,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:20:56,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-19 05:20:56,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:56,745 INFO L225 Difference]: With dead ends: 23453 [2019-12-19 05:20:56,746 INFO L226 Difference]: Without dead ends: 21277 [2019-12-19 05:20:56,753 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:20:57,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21277 states. [2019-12-19 05:20:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21277 to 21277. [2019-12-19 05:20:58,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21277 states. [2019-12-19 05:20:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 83794 transitions. [2019-12-19 05:20:58,662 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 83794 transitions. Word has length 32 [2019-12-19 05:20:58,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:58,662 INFO L462 AbstractCegarLoop]: Abstraction has 21277 states and 83794 transitions. [2019-12-19 05:20:58,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:58,663 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 83794 transitions. [2019-12-19 05:20:58,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-19 05:20:58,669 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:58,670 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:20:58,670 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:58,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:58,671 INFO L82 PathProgramCache]: Analyzing trace with hash -2036668926, now seen corresponding path program 1 times [2019-12-19 05:20:58,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:58,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928754956] [2019-12-19 05:20:58,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:58,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:58,818 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:20:58,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928754956] [2019-12-19 05:20:58,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:58,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:58,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263820416] [2019-12-19 05:20:58,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:58,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:58,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:58,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:58,824 INFO L87 Difference]: Start difference. First operand 21277 states and 83794 transitions. Second operand 5 states. [2019-12-19 05:20:59,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:59,987 INFO L93 Difference]: Finished difference Result 34711 states and 129090 transitions. [2019-12-19 05:20:59,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:59,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-19 05:20:59,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:00,149 INFO L225 Difference]: With dead ends: 34711 [2019-12-19 05:21:00,149 INFO L226 Difference]: Without dead ends: 34567 [2019-12-19 05:21:00,150 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:21:00,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-12-19 05:21:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 33067. [2019-12-19 05:21:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33067 states. [2019-12-19 05:21:02,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33067 states to 33067 states and 123978 transitions. [2019-12-19 05:21:02,356 INFO L78 Accepts]: Start accepts. Automaton has 33067 states and 123978 transitions. Word has length 43 [2019-12-19 05:21:02,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:02,357 INFO L462 AbstractCegarLoop]: Abstraction has 33067 states and 123978 transitions. [2019-12-19 05:21:02,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 33067 states and 123978 transitions. [2019-12-19 05:21:02,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 05:21:02,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:02,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] [2019-12-19 05:21:02,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:02,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:02,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1802978339, now seen corresponding path program 1 times [2019-12-19 05:21:02,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:02,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239695279] [2019-12-19 05:21:02,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:02,700 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:21:02,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239695279] [2019-12-19 05:21:02,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:02,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:02,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455700038] [2019-12-19 05:21:02,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:02,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:02,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:02,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:02,703 INFO L87 Difference]: Start difference. First operand 33067 states and 123978 transitions. Second operand 5 states. [2019-12-19 05:21:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:03,331 INFO L93 Difference]: Finished difference Result 40219 states and 148647 transitions. [2019-12-19 05:21:03,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:03,332 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 05:21:03,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:03,499 INFO L225 Difference]: With dead ends: 40219 [2019-12-19 05:21:03,499 INFO L226 Difference]: Without dead ends: 40059 [2019-12-19 05:21:03,500 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:21:03,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40059 states. [2019-12-19 05:21:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40059 to 34640. [2019-12-19 05:21:05,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34640 states. [2019-12-19 05:21:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34640 states to 34640 states and 129274 transitions. [2019-12-19 05:21:05,888 INFO L78 Accepts]: Start accepts. Automaton has 34640 states and 129274 transitions. Word has length 44 [2019-12-19 05:21:05,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:05,889 INFO L462 AbstractCegarLoop]: Abstraction has 34640 states and 129274 transitions. [2019-12-19 05:21:05,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:05,889 INFO L276 IsEmpty]: Start isEmpty. Operand 34640 states and 129274 transitions. [2019-12-19 05:21:05,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 05:21:05,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:05,904 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:21:05,905 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:05,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1187379522, now seen corresponding path program 1 times [2019-12-19 05:21:05,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:05,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159850475] [2019-12-19 05:21:05,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:05,997 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:21:05,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159850475] [2019-12-19 05:21:05,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:05,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:05,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711412907] [2019-12-19 05:21:06,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:06,001 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:06,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:06,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:06,001 INFO L87 Difference]: Start difference. First operand 34640 states and 129274 transitions. Second operand 6 states. [2019-12-19 05:21:06,599 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-19 05:21:07,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:07,196 INFO L93 Difference]: Finished difference Result 45668 states and 166168 transitions. [2019-12-19 05:21:07,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:21:07,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-19 05:21:07,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:07,405 INFO L225 Difference]: With dead ends: 45668 [2019-12-19 05:21:07,414 INFO L226 Difference]: Without dead ends: 45524 [2019-12-19 05:21:07,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 05:21:07,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45524 states. [2019-12-19 05:21:09,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45524 to 33603. [2019-12-19 05:21:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33603 states. [2019-12-19 05:21:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33603 states to 33603 states and 125429 transitions. [2019-12-19 05:21:09,844 INFO L78 Accepts]: Start accepts. Automaton has 33603 states and 125429 transitions. Word has length 51 [2019-12-19 05:21:09,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:09,845 INFO L462 AbstractCegarLoop]: Abstraction has 33603 states and 125429 transitions. [2019-12-19 05:21:09,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 33603 states and 125429 transitions. [2019-12-19 05:21:09,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 05:21:09,880 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:09,880 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:21:09,880 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:09,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:09,881 INFO L82 PathProgramCache]: Analyzing trace with hash -2042153850, now seen corresponding path program 1 times [2019-12-19 05:21:09,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:09,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319274800] [2019-12-19 05:21:09,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:10,007 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:21:10,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319274800] [2019-12-19 05:21:10,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:10,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:10,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511861881] [2019-12-19 05:21:10,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:10,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:10,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:10,010 INFO L87 Difference]: Start difference. First operand 33603 states and 125429 transitions. Second operand 6 states. [2019-12-19 05:21:10,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:10,702 INFO L93 Difference]: Finished difference Result 46075 states and 167862 transitions. [2019-12-19 05:21:10,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 05:21:10,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 05:21:10,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:11,211 INFO L225 Difference]: With dead ends: 46075 [2019-12-19 05:21:11,211 INFO L226 Difference]: Without dead ends: 45835 [2019-12-19 05:21:11,213 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:21:11,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45835 states. [2019-12-19 05:21:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45835 to 39964. [2019-12-19 05:21:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39964 states. [2019-12-19 05:21:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39964 states to 39964 states and 147353 transitions. [2019-12-19 05:21:14,304 INFO L78 Accepts]: Start accepts. Automaton has 39964 states and 147353 transitions. Word has length 58 [2019-12-19 05:21:14,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:14,304 INFO L462 AbstractCegarLoop]: Abstraction has 39964 states and 147353 transitions. [2019-12-19 05:21:14,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:14,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39964 states and 147353 transitions. [2019-12-19 05:21:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:21:14,334 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:14,334 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:21:14,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:14,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:14,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1541499923, now seen corresponding path program 1 times [2019-12-19 05:21:14,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:14,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906400045] [2019-12-19 05:21:14,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:14,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:14,388 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:21:14,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906400045] [2019-12-19 05:21:14,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:14,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:14,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221996992] [2019-12-19 05:21:14,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:14,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:14,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:14,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:14,391 INFO L87 Difference]: Start difference. First operand 39964 states and 147353 transitions. Second operand 3 states. [2019-12-19 05:21:14,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:14,658 INFO L93 Difference]: Finished difference Result 50262 states and 182188 transitions. [2019-12-19 05:21:14,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:14,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-19 05:21:14,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:14,762 INFO L225 Difference]: With dead ends: 50262 [2019-12-19 05:21:14,762 INFO L226 Difference]: Without dead ends: 50262 [2019-12-19 05:21:14,762 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:21:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50262 states. [2019-12-19 05:21:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50262 to 43894. [2019-12-19 05:21:15,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43894 states. [2019-12-19 05:21:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43894 states to 43894 states and 160791 transitions. [2019-12-19 05:21:15,825 INFO L78 Accepts]: Start accepts. Automaton has 43894 states and 160791 transitions. Word has length 60 [2019-12-19 05:21:15,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:15,825 INFO L462 AbstractCegarLoop]: Abstraction has 43894 states and 160791 transitions. [2019-12-19 05:21:15,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 43894 states and 160791 transitions. [2019-12-19 05:21:15,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 05:21:15,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:15,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:21:15,861 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:15,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:15,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1207224336, now seen corresponding path program 1 times [2019-12-19 05:21:15,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:15,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981131583] [2019-12-19 05:21:15,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:15,971 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:21:15,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981131583] [2019-12-19 05:21:15,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:15,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:15,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368037235] [2019-12-19 05:21:15,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:15,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:15,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:15,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:15,974 INFO L87 Difference]: Start difference. First operand 43894 states and 160791 transitions. Second operand 7 states. [2019-12-19 05:21:17,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:17,029 INFO L93 Difference]: Finished difference Result 55890 states and 200525 transitions. [2019-12-19 05:21:17,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:21:17,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-19 05:21:17,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:17,148 INFO L225 Difference]: With dead ends: 55890 [2019-12-19 05:21:17,148 INFO L226 Difference]: Without dead ends: 55650 [2019-12-19 05:21:17,149 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:21:17,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55650 states. [2019-12-19 05:21:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55650 to 45120. [2019-12-19 05:21:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45120 states. [2019-12-19 05:21:18,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45120 states to 45120 states and 164958 transitions. [2019-12-19 05:21:18,454 INFO L78 Accepts]: Start accepts. Automaton has 45120 states and 164958 transitions. Word has length 64 [2019-12-19 05:21:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:18,454 INFO L462 AbstractCegarLoop]: Abstraction has 45120 states and 164958 transitions. [2019-12-19 05:21:18,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:18,454 INFO L276 IsEmpty]: Start isEmpty. Operand 45120 states and 164958 transitions. [2019-12-19 05:21:18,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:21:18,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:18,492 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:21:18,492 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:18,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:18,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2064437065, now seen corresponding path program 1 times [2019-12-19 05:21:18,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:18,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974449616] [2019-12-19 05:21:18,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:18,626 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:21:18,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974449616] [2019-12-19 05:21:18,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:18,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:18,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69217371] [2019-12-19 05:21:18,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:18,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:18,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:18,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:18,630 INFO L87 Difference]: Start difference. First operand 45120 states and 164958 transitions. Second operand 6 states. [2019-12-19 05:21:19,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:19,798 INFO L93 Difference]: Finished difference Result 62662 states and 223894 transitions. [2019-12-19 05:21:19,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:21:19,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 05:21:19,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:19,935 INFO L225 Difference]: With dead ends: 62662 [2019-12-19 05:21:19,936 INFO L226 Difference]: Without dead ends: 62518 [2019-12-19 05:21:19,936 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:21:20,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62518 states. [2019-12-19 05:21:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62518 to 48801. [2019-12-19 05:21:21,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48801 states. [2019-12-19 05:21:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48801 states to 48801 states and 177924 transitions. [2019-12-19 05:21:21,392 INFO L78 Accepts]: Start accepts. Automaton has 48801 states and 177924 transitions. Word has length 65 [2019-12-19 05:21:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:21,392 INFO L462 AbstractCegarLoop]: Abstraction has 48801 states and 177924 transitions. [2019-12-19 05:21:21,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 48801 states and 177924 transitions. [2019-12-19 05:21:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:21:21,427 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:21,427 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:21:21,427 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:21,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:21,427 INFO L82 PathProgramCache]: Analyzing trace with hash -978936533, now seen corresponding path program 2 times [2019-12-19 05:21:21,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:21,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355289615] [2019-12-19 05:21:21,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:21,546 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:21:21,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355289615] [2019-12-19 05:21:21,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:21,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:21,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955253971] [2019-12-19 05:21:21,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:21,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:21,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:21,549 INFO L87 Difference]: Start difference. First operand 48801 states and 177924 transitions. Second operand 7 states. [2019-12-19 05:21:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:22,691 INFO L93 Difference]: Finished difference Result 58785 states and 210668 transitions. [2019-12-19 05:21:22,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:21:22,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 05:21:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:22,816 INFO L225 Difference]: With dead ends: 58785 [2019-12-19 05:21:22,816 INFO L226 Difference]: Without dead ends: 58585 [2019-12-19 05:21:22,817 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:21:23,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58585 states. [2019-12-19 05:21:25,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58585 to 45998. [2019-12-19 05:21:25,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45998 states. [2019-12-19 05:21:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45998 states to 45998 states and 167829 transitions. [2019-12-19 05:21:25,970 INFO L78 Accepts]: Start accepts. Automaton has 45998 states and 167829 transitions. Word has length 65 [2019-12-19 05:21:25,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:25,971 INFO L462 AbstractCegarLoop]: Abstraction has 45998 states and 167829 transitions. [2019-12-19 05:21:25,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:25,971 INFO L276 IsEmpty]: Start isEmpty. Operand 45998 states and 167829 transitions. [2019-12-19 05:21:26,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:21:26,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:26,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:21:26,013 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:26,013 INFO L82 PathProgramCache]: Analyzing trace with hash 379551327, now seen corresponding path program 1 times [2019-12-19 05:21:26,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:26,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189079628] [2019-12-19 05:21:26,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:26,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:26,069 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:21:26,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189079628] [2019-12-19 05:21:26,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:26,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:26,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979149766] [2019-12-19 05:21:26,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:26,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:26,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:26,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:26,071 INFO L87 Difference]: Start difference. First operand 45998 states and 167829 transitions. Second operand 3 states. [2019-12-19 05:21:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:26,489 INFO L93 Difference]: Finished difference Result 61492 states and 224163 transitions. [2019-12-19 05:21:26,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:26,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 05:21:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:27,108 INFO L225 Difference]: With dead ends: 61492 [2019-12-19 05:21:27,108 INFO L226 Difference]: Without dead ends: 61492 [2019-12-19 05:21:27,108 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:21:27,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61492 states. [2019-12-19 05:21:27,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61492 to 53439. [2019-12-19 05:21:27,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53439 states. [2019-12-19 05:21:28,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53439 states to 53439 states and 195642 transitions. [2019-12-19 05:21:28,101 INFO L78 Accepts]: Start accepts. Automaton has 53439 states and 195642 transitions. Word has length 67 [2019-12-19 05:21:28,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:28,102 INFO L462 AbstractCegarLoop]: Abstraction has 53439 states and 195642 transitions. [2019-12-19 05:21:28,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:28,102 INFO L276 IsEmpty]: Start isEmpty. Operand 53439 states and 195642 transitions. [2019-12-19 05:21:28,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:21:28,160 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:28,160 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:21:28,161 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:28,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:28,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1904207583, now seen corresponding path program 1 times [2019-12-19 05:21:28,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:28,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759644361] [2019-12-19 05:21:28,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:28,279 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:21:28,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759644361] [2019-12-19 05:21:28,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:28,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:28,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865671864] [2019-12-19 05:21:28,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:28,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:28,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:28,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:28,282 INFO L87 Difference]: Start difference. First operand 53439 states and 195642 transitions. Second operand 6 states. [2019-12-19 05:21:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:29,533 INFO L93 Difference]: Finished difference Result 65988 states and 238856 transitions. [2019-12-19 05:21:29,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:29,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 05:21:29,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:29,676 INFO L225 Difference]: With dead ends: 65988 [2019-12-19 05:21:29,676 INFO L226 Difference]: Without dead ends: 65344 [2019-12-19 05:21:29,677 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:21:29,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65344 states. [2019-12-19 05:21:30,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65344 to 56048. [2019-12-19 05:21:30,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56048 states. [2019-12-19 05:21:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56048 states to 56048 states and 204359 transitions. [2019-12-19 05:21:33,531 INFO L78 Accepts]: Start accepts. Automaton has 56048 states and 204359 transitions. Word has length 67 [2019-12-19 05:21:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:33,531 INFO L462 AbstractCegarLoop]: Abstraction has 56048 states and 204359 transitions. [2019-12-19 05:21:33,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56048 states and 204359 transitions. [2019-12-19 05:21:33,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:21:33,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:33,574 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:21:33,575 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:33,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:33,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1429145696, now seen corresponding path program 1 times [2019-12-19 05:21:33,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:33,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906928531] [2019-12-19 05:21:33,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:33,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:33,700 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:21:33,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906928531] [2019-12-19 05:21:33,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:33,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:33,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927494321] [2019-12-19 05:21:33,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:33,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:33,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:33,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:33,702 INFO L87 Difference]: Start difference. First operand 56048 states and 204359 transitions. Second operand 7 states. [2019-12-19 05:21:34,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:34,912 INFO L93 Difference]: Finished difference Result 83036 states and 292787 transitions. [2019-12-19 05:21:34,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:21:34,913 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 05:21:34,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:35,093 INFO L225 Difference]: With dead ends: 83036 [2019-12-19 05:21:35,094 INFO L226 Difference]: Without dead ends: 83036 [2019-12-19 05:21:35,094 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:21:35,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83036 states. [2019-12-19 05:21:36,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83036 to 76085. [2019-12-19 05:21:36,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76085 states. [2019-12-19 05:21:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76085 states to 76085 states and 270654 transitions. [2019-12-19 05:21:36,861 INFO L78 Accepts]: Start accepts. Automaton has 76085 states and 270654 transitions. Word has length 67 [2019-12-19 05:21:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:36,862 INFO L462 AbstractCegarLoop]: Abstraction has 76085 states and 270654 transitions. [2019-12-19 05:21:36,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:36,862 INFO L276 IsEmpty]: Start isEmpty. Operand 76085 states and 270654 transitions. [2019-12-19 05:21:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:21:36,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:36,924 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:21:36,924 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:36,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:36,925 INFO L82 PathProgramCache]: Analyzing trace with hash -184381215, now seen corresponding path program 1 times [2019-12-19 05:21:36,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:36,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192163474] [2019-12-19 05:21:36,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:37,015 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:21:37,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192163474] [2019-12-19 05:21:37,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:37,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:37,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522498110] [2019-12-19 05:21:37,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:37,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:37,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:37,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:37,018 INFO L87 Difference]: Start difference. First operand 76085 states and 270654 transitions. Second operand 4 states. [2019-12-19 05:21:37,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:37,095 INFO L93 Difference]: Finished difference Result 17230 states and 54532 transitions. [2019-12-19 05:21:37,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:37,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 05:21:37,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:37,120 INFO L225 Difference]: With dead ends: 17230 [2019-12-19 05:21:37,121 INFO L226 Difference]: Without dead ends: 16752 [2019-12-19 05:21:37,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:21:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16752 states. [2019-12-19 05:21:37,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16752 to 16740. [2019-12-19 05:21:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16740 states. [2019-12-19 05:21:37,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16740 states to 16740 states and 53027 transitions. [2019-12-19 05:21:37,344 INFO L78 Accepts]: Start accepts. Automaton has 16740 states and 53027 transitions. Word has length 67 [2019-12-19 05:21:37,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:37,344 INFO L462 AbstractCegarLoop]: Abstraction has 16740 states and 53027 transitions. [2019-12-19 05:21:37,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:37,344 INFO L276 IsEmpty]: Start isEmpty. Operand 16740 states and 53027 transitions. [2019-12-19 05:21:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:21:37,362 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:37,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] [2019-12-19 05:21:37,362 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1457085175, now seen corresponding path program 1 times [2019-12-19 05:21:37,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:37,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13670873] [2019-12-19 05:21:37,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:37,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:21:37,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13670873] [2019-12-19 05:21:37,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:37,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:37,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540551129] [2019-12-19 05:21:37,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:37,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:37,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:37,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:37,453 INFO L87 Difference]: Start difference. First operand 16740 states and 53027 transitions. Second operand 4 states. [2019-12-19 05:21:37,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:37,690 INFO L93 Difference]: Finished difference Result 22104 states and 69108 transitions. [2019-12-19 05:21:37,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:37,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-19 05:21:37,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:37,723 INFO L225 Difference]: With dead ends: 22104 [2019-12-19 05:21:37,723 INFO L226 Difference]: Without dead ends: 22104 [2019-12-19 05:21:37,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:37,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-19 05:21:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 17616. [2019-12-19 05:21:38,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17616 states. [2019-12-19 05:21:38,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17616 states to 17616 states and 55586 transitions. [2019-12-19 05:21:38,191 INFO L78 Accepts]: Start accepts. Automaton has 17616 states and 55586 transitions. Word has length 77 [2019-12-19 05:21:38,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:38,192 INFO L462 AbstractCegarLoop]: Abstraction has 17616 states and 55586 transitions. [2019-12-19 05:21:38,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:38,192 INFO L276 IsEmpty]: Start isEmpty. Operand 17616 states and 55586 transitions. [2019-12-19 05:21:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:21:38,206 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:38,206 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:21:38,206 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:38,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:38,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1202348630, now seen corresponding path program 1 times [2019-12-19 05:21:38,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:38,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833546583] [2019-12-19 05:21:38,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:38,308 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:21:38,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833546583] [2019-12-19 05:21:38,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:38,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:21:38,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064568933] [2019-12-19 05:21:38,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:21:38,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:38,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:21:38,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:21:38,311 INFO L87 Difference]: Start difference. First operand 17616 states and 55586 transitions. Second operand 8 states. [2019-12-19 05:21:39,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:39,492 INFO L93 Difference]: Finished difference Result 19710 states and 61662 transitions. [2019-12-19 05:21:39,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 05:21:39,493 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-19 05:21:39,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:39,523 INFO L225 Difference]: With dead ends: 19710 [2019-12-19 05:21:39,523 INFO L226 Difference]: Without dead ends: 19662 [2019-12-19 05:21:39,523 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:21:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-19 05:21:39,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 15534. [2019-12-19 05:21:39,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15534 states. [2019-12-19 05:21:39,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15534 states to 15534 states and 49320 transitions. [2019-12-19 05:21:39,764 INFO L78 Accepts]: Start accepts. Automaton has 15534 states and 49320 transitions. Word has length 77 [2019-12-19 05:21:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:39,765 INFO L462 AbstractCegarLoop]: Abstraction has 15534 states and 49320 transitions. [2019-12-19 05:21:39,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:21:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 15534 states and 49320 transitions. [2019-12-19 05:21:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 05:21:39,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:39,778 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:21:39,778 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:39,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash -155414719, now seen corresponding path program 1 times [2019-12-19 05:21:39,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:39,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198775828] [2019-12-19 05:21:39,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:39,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 05:21:39,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198775828] [2019-12-19 05:21:39,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:39,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:39,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419448591] [2019-12-19 05:21:39,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:39,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:39,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:39,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:39,842 INFO L87 Difference]: Start difference. First operand 15534 states and 49320 transitions. Second operand 3 states. [2019-12-19 05:21:40,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:40,131 INFO L93 Difference]: Finished difference Result 16798 states and 53033 transitions. [2019-12-19 05:21:40,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:40,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-19 05:21:40,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:40,168 INFO L225 Difference]: With dead ends: 16798 [2019-12-19 05:21:40,169 INFO L226 Difference]: Without dead ends: 16798 [2019-12-19 05:21:40,169 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:21:40,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16798 states. [2019-12-19 05:21:40,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16798 to 16150. [2019-12-19 05:21:40,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16150 states. [2019-12-19 05:21:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16150 states to 16150 states and 51134 transitions. [2019-12-19 05:21:40,453 INFO L78 Accepts]: Start accepts. Automaton has 16150 states and 51134 transitions. Word has length 78 [2019-12-19 05:21:40,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:40,453 INFO L462 AbstractCegarLoop]: Abstraction has 16150 states and 51134 transitions. [2019-12-19 05:21:40,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 16150 states and 51134 transitions. [2019-12-19 05:21:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:21:40,467 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:40,467 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:21:40,467 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:40,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:40,467 INFO L82 PathProgramCache]: Analyzing trace with hash 2033602545, now seen corresponding path program 1 times [2019-12-19 05:21:40,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:40,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120240752] [2019-12-19 05:21:40,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:40,534 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:21:40,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120240752] [2019-12-19 05:21:40,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:40,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:40,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237204635] [2019-12-19 05:21:40,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:40,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:40,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:40,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:40,536 INFO L87 Difference]: Start difference. First operand 16150 states and 51134 transitions. Second operand 4 states. [2019-12-19 05:21:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:40,827 INFO L93 Difference]: Finished difference Result 19318 states and 60264 transitions. [2019-12-19 05:21:40,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:21:40,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-19 05:21:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:40,857 INFO L225 Difference]: With dead ends: 19318 [2019-12-19 05:21:40,857 INFO L226 Difference]: Without dead ends: 19318 [2019-12-19 05:21:40,857 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:21:40,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19318 states. [2019-12-19 05:21:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19318 to 18295. [2019-12-19 05:21:41,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18295 states. [2019-12-19 05:21:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18295 states to 18295 states and 57380 transitions. [2019-12-19 05:21:41,378 INFO L78 Accepts]: Start accepts. Automaton has 18295 states and 57380 transitions. Word has length 79 [2019-12-19 05:21:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:41,378 INFO L462 AbstractCegarLoop]: Abstraction has 18295 states and 57380 transitions. [2019-12-19 05:21:41,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 18295 states and 57380 transitions. [2019-12-19 05:21:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:21:41,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:41,394 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:21:41,395 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:41,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:41,395 INFO L82 PathProgramCache]: Analyzing trace with hash 332862066, now seen corresponding path program 1 times [2019-12-19 05:21:41,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:41,395 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121536166] [2019-12-19 05:21:41,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:41,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:41,429 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:21:41,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121536166] [2019-12-19 05:21:41,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:41,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:41,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923662267] [2019-12-19 05:21:41,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:41,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:41,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:41,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:41,433 INFO L87 Difference]: Start difference. First operand 18295 states and 57380 transitions. Second operand 3 states. [2019-12-19 05:21:41,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:41,774 INFO L93 Difference]: Finished difference Result 19638 states and 61303 transitions. [2019-12-19 05:21:41,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:41,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 05:21:41,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:41,829 INFO L225 Difference]: With dead ends: 19638 [2019-12-19 05:21:41,829 INFO L226 Difference]: Without dead ends: 19638 [2019-12-19 05:21:41,829 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:21:41,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19638 states. [2019-12-19 05:21:42,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19638 to 18975. [2019-12-19 05:21:42,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18975 states. [2019-12-19 05:21:42,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18975 states to 18975 states and 59360 transitions. [2019-12-19 05:21:42,318 INFO L78 Accepts]: Start accepts. Automaton has 18975 states and 59360 transitions. Word has length 79 [2019-12-19 05:21:42,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:42,319 INFO L462 AbstractCegarLoop]: Abstraction has 18975 states and 59360 transitions. [2019-12-19 05:21:42,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:42,319 INFO L276 IsEmpty]: Start isEmpty. Operand 18975 states and 59360 transitions. [2019-12-19 05:21:42,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:42,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:42,345 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:21:42,354 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:42,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:42,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1580742388, now seen corresponding path program 1 times [2019-12-19 05:21:42,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:42,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437162239] [2019-12-19 05:21:42,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:42,441 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:21:42,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437162239] [2019-12-19 05:21:42,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:42,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:21:42,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683570078] [2019-12-19 05:21:42,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:21:42,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:42,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:21:42,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:21:42,443 INFO L87 Difference]: Start difference. First operand 18975 states and 59360 transitions. Second operand 8 states. [2019-12-19 05:21:45,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:45,612 INFO L93 Difference]: Finished difference Result 52657 states and 160091 transitions. [2019-12-19 05:21:45,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 05:21:45,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-19 05:21:45,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:45,760 INFO L225 Difference]: With dead ends: 52657 [2019-12-19 05:21:45,761 INFO L226 Difference]: Without dead ends: 52240 [2019-12-19 05:21:45,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-19 05:21:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52240 states. [2019-12-19 05:21:46,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52240 to 28682. [2019-12-19 05:21:46,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28682 states. [2019-12-19 05:21:46,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28682 states to 28682 states and 89258 transitions. [2019-12-19 05:21:46,798 INFO L78 Accepts]: Start accepts. Automaton has 28682 states and 89258 transitions. Word has length 80 [2019-12-19 05:21:46,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:46,799 INFO L462 AbstractCegarLoop]: Abstraction has 28682 states and 89258 transitions. [2019-12-19 05:21:46,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:21:46,799 INFO L276 IsEmpty]: Start isEmpty. Operand 28682 states and 89258 transitions. [2019-12-19 05:21:46,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:46,830 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:46,830 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:46,831 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:46,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:46,831 INFO L82 PathProgramCache]: Analyzing trace with hash -507846410, now seen corresponding path program 1 times [2019-12-19 05:21:46,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:46,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311059967] [2019-12-19 05:21:46,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:46,924 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:21:46,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311059967] [2019-12-19 05:21:46,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:46,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:46,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915689404] [2019-12-19 05:21:46,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:46,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:46,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:46,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:46,927 INFO L87 Difference]: Start difference. First operand 28682 states and 89258 transitions. Second operand 6 states. [2019-12-19 05:21:47,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:47,461 INFO L93 Difference]: Finished difference Result 30407 states and 93751 transitions. [2019-12-19 05:21:47,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:47,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:21:47,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:47,506 INFO L225 Difference]: With dead ends: 30407 [2019-12-19 05:21:47,506 INFO L226 Difference]: Without dead ends: 30407 [2019-12-19 05:21:47,506 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:21:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30407 states. [2019-12-19 05:21:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30407 to 29149. [2019-12-19 05:21:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29149 states. [2019-12-19 05:21:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29149 states to 29149 states and 90160 transitions. [2019-12-19 05:21:47,906 INFO L78 Accepts]: Start accepts. Automaton has 29149 states and 90160 transitions. Word has length 80 [2019-12-19 05:21:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:47,907 INFO L462 AbstractCegarLoop]: Abstraction has 29149 states and 90160 transitions. [2019-12-19 05:21:47,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 29149 states and 90160 transitions. [2019-12-19 05:21:47,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:47,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:47,932 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:21:47,932 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:47,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:47,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1851460599, now seen corresponding path program 1 times [2019-12-19 05:21:47,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:47,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092936657] [2019-12-19 05:21:47,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:48,041 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:21:48,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092936657] [2019-12-19 05:21:48,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:48,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:48,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694293649] [2019-12-19 05:21:48,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:48,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:48,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:48,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:48,044 INFO L87 Difference]: Start difference. First operand 29149 states and 90160 transitions. Second operand 7 states. [2019-12-19 05:21:48,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:48,691 INFO L93 Difference]: Finished difference Result 30834 states and 94868 transitions. [2019-12-19 05:21:48,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:21:48,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-19 05:21:48,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:48,737 INFO L225 Difference]: With dead ends: 30834 [2019-12-19 05:21:48,737 INFO L226 Difference]: Without dead ends: 30834 [2019-12-19 05:21:48,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:21:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30834 states. [2019-12-19 05:21:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30834 to 29512. [2019-12-19 05:21:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29512 states. [2019-12-19 05:21:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29512 states to 29512 states and 91025 transitions. [2019-12-19 05:21:49,144 INFO L78 Accepts]: Start accepts. Automaton has 29512 states and 91025 transitions. Word has length 80 [2019-12-19 05:21:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:49,144 INFO L462 AbstractCegarLoop]: Abstraction has 29512 states and 91025 transitions. [2019-12-19 05:21:49,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 29512 states and 91025 transitions. [2019-12-19 05:21:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:49,173 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:49,173 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:21:49,173 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:49,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2113740936, now seen corresponding path program 1 times [2019-12-19 05:21:49,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:49,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533079645] [2019-12-19 05:21:49,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:49,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:49,225 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:21:49,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533079645] [2019-12-19 05:21:49,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:49,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:21:49,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982256508] [2019-12-19 05:21:49,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:21:49,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:49,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:21:49,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:49,227 INFO L87 Difference]: Start difference. First operand 29512 states and 91025 transitions. Second operand 3 states. [2019-12-19 05:21:49,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:49,346 INFO L93 Difference]: Finished difference Result 22465 states and 68730 transitions. [2019-12-19 05:21:49,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:21:49,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 05:21:49,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:49,391 INFO L225 Difference]: With dead ends: 22465 [2019-12-19 05:21:49,391 INFO L226 Difference]: Without dead ends: 22465 [2019-12-19 05:21:49,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:21:49,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22465 states. [2019-12-19 05:21:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22465 to 21651. [2019-12-19 05:21:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21651 states. [2019-12-19 05:21:49,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21651 states to 21651 states and 66414 transitions. [2019-12-19 05:21:49,959 INFO L78 Accepts]: Start accepts. Automaton has 21651 states and 66414 transitions. Word has length 80 [2019-12-19 05:21:49,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:49,960 INFO L462 AbstractCegarLoop]: Abstraction has 21651 states and 66414 transitions. [2019-12-19 05:21:49,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:21:49,960 INFO L276 IsEmpty]: Start isEmpty. Operand 21651 states and 66414 transitions. [2019-12-19 05:21:49,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:49,981 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:49,981 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:21:49,981 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:49,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:49,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1936604585, now seen corresponding path program 1 times [2019-12-19 05:21:49,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:49,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169885242] [2019-12-19 05:21:49,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:50,066 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:21:50,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169885242] [2019-12-19 05:21:50,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:50,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:50,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097569576] [2019-12-19 05:21:50,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:50,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:50,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:50,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:50,068 INFO L87 Difference]: Start difference. First operand 21651 states and 66414 transitions. Second operand 7 states. [2019-12-19 05:21:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:50,831 INFO L93 Difference]: Finished difference Result 39045 states and 119676 transitions. [2019-12-19 05:21:50,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:21:50,831 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-19 05:21:50,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:50,891 INFO L225 Difference]: With dead ends: 39045 [2019-12-19 05:21:50,891 INFO L226 Difference]: Without dead ends: 39045 [2019-12-19 05:21:50,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:21:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39045 states. [2019-12-19 05:21:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39045 to 23068. [2019-12-19 05:21:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23068 states. [2019-12-19 05:21:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23068 states to 23068 states and 70714 transitions. [2019-12-19 05:21:51,299 INFO L78 Accepts]: Start accepts. Automaton has 23068 states and 70714 transitions. Word has length 80 [2019-12-19 05:21:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:51,299 INFO L462 AbstractCegarLoop]: Abstraction has 23068 states and 70714 transitions. [2019-12-19 05:21:51,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 23068 states and 70714 transitions. [2019-12-19 05:21:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:21:51,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:51,322 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:21:51,322 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:51,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash -632881814, now seen corresponding path program 1 times [2019-12-19 05:21:51,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:51,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190479369] [2019-12-19 05:21:51,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:51,408 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:21:51,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190479369] [2019-12-19 05:21:51,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:51,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:51,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955904731] [2019-12-19 05:21:51,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:51,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:51,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:51,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:51,410 INFO L87 Difference]: Start difference. First operand 23068 states and 70714 transitions. Second operand 5 states. [2019-12-19 05:21:51,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:51,460 INFO L93 Difference]: Finished difference Result 3274 states and 8033 transitions. [2019-12-19 05:21:51,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:21:51,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:21:51,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:51,465 INFO L225 Difference]: With dead ends: 3274 [2019-12-19 05:21:51,465 INFO L226 Difference]: Without dead ends: 2815 [2019-12-19 05:21:51,465 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:21:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2019-12-19 05:21:51,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2541. [2019-12-19 05:21:51,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-12-19 05:21:51,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 6203 transitions. [2019-12-19 05:21:51,511 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 6203 transitions. Word has length 80 [2019-12-19 05:21:51,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:51,511 INFO L462 AbstractCegarLoop]: Abstraction has 2541 states and 6203 transitions. [2019-12-19 05:21:51,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:51,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 6203 transitions. [2019-12-19 05:21:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:51,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:51,516 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:21:51,517 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:51,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:51,517 INFO L82 PathProgramCache]: Analyzing trace with hash 211784789, now seen corresponding path program 1 times [2019-12-19 05:21:51,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:51,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431777811] [2019-12-19 05:21:51,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:51,595 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:21:51,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431777811] [2019-12-19 05:21:51,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:51,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:51,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964786047] [2019-12-19 05:21:51,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:51,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:51,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:51,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:51,598 INFO L87 Difference]: Start difference. First operand 2541 states and 6203 transitions. Second operand 6 states. [2019-12-19 05:21:51,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:51,896 INFO L93 Difference]: Finished difference Result 3131 states and 7603 transitions. [2019-12-19 05:21:51,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:51,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:21:51,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:51,901 INFO L225 Difference]: With dead ends: 3131 [2019-12-19 05:21:51,901 INFO L226 Difference]: Without dead ends: 3113 [2019-12-19 05:21:51,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:21:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2019-12-19 05:21:51,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2790. [2019-12-19 05:21:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-12-19 05:21:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 6803 transitions. [2019-12-19 05:21:51,932 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 6803 transitions. Word has length 92 [2019-12-19 05:21:51,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:51,932 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 6803 transitions. [2019-12-19 05:21:51,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:51,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 6803 transitions. [2019-12-19 05:21:51,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:51,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:51,935 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:21:51,935 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:51,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:51,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1173398806, now seen corresponding path program 1 times [2019-12-19 05:21:51,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:51,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053502584] [2019-12-19 05:21:51,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:52,031 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:21:52,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053502584] [2019-12-19 05:21:52,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:52,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:52,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946856250] [2019-12-19 05:21:52,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:52,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:52,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:52,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:52,033 INFO L87 Difference]: Start difference. First operand 2790 states and 6803 transitions. Second operand 6 states. [2019-12-19 05:21:52,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:52,304 INFO L93 Difference]: Finished difference Result 2990 states and 7156 transitions. [2019-12-19 05:21:52,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:52,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:21:52,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:52,310 INFO L225 Difference]: With dead ends: 2990 [2019-12-19 05:21:52,310 INFO L226 Difference]: Without dead ends: 2938 [2019-12-19 05:21:52,310 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:21:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2019-12-19 05:21:52,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2881. [2019-12-19 05:21:52,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-12-19 05:21:52,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 6969 transitions. [2019-12-19 05:21:52,338 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 6969 transitions. Word has length 92 [2019-12-19 05:21:52,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:52,338 INFO L462 AbstractCegarLoop]: Abstraction has 2881 states and 6969 transitions. [2019-12-19 05:21:52,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:52,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 6969 transitions. [2019-12-19 05:21:52,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:52,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21:52,341 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:52,342 INFO L82 PathProgramCache]: Analyzing trace with hash 738198895, now seen corresponding path program 1 times [2019-12-19 05:21:52,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:52,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042795384] [2019-12-19 05:21:52,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:52,399 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:21:52,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042795384] [2019-12-19 05:21:52,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:52,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:21:52,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383490137] [2019-12-19 05:21:52,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:21:52,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:52,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:21:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:21:52,401 INFO L87 Difference]: Start difference. First operand 2881 states and 6969 transitions. Second operand 4 states. [2019-12-19 05:21:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:52,434 INFO L93 Difference]: Finished difference Result 2703 states and 6512 transitions. [2019-12-19 05:21:52,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:52,434 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-19 05:21:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:52,439 INFO L225 Difference]: With dead ends: 2703 [2019-12-19 05:21:52,439 INFO L226 Difference]: Without dead ends: 2703 [2019-12-19 05:21:52,439 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:21:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-12-19 05:21:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2624. [2019-12-19 05:21:52,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-12-19 05:21:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 6310 transitions. [2019-12-19 05:21:52,478 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 6310 transitions. Word has length 92 [2019-12-19 05:21:52,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:52,478 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 6310 transitions. [2019-12-19 05:21:52,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:21:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 6310 transitions. [2019-12-19 05:21:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:52,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:52,482 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:21:52,482 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:52,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:52,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1220152845, now seen corresponding path program 1 times [2019-12-19 05:21:52,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:52,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847932540] [2019-12-19 05:21:52,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:52,541 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:21:52,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847932540] [2019-12-19 05:21:52,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:52,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:52,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216269433] [2019-12-19 05:21:52,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:52,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:52,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:52,543 INFO L87 Difference]: Start difference. First operand 2624 states and 6310 transitions. Second operand 5 states. [2019-12-19 05:21:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:52,777 INFO L93 Difference]: Finished difference Result 3041 states and 7197 transitions. [2019-12-19 05:21:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:21:52,778 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:21:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:52,782 INFO L225 Difference]: With dead ends: 3041 [2019-12-19 05:21:52,783 INFO L226 Difference]: Without dead ends: 3015 [2019-12-19 05:21:52,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 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:21:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2019-12-19 05:21:52,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2695. [2019-12-19 05:21:52,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-12-19 05:21:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 6452 transitions. [2019-12-19 05:21:52,822 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 6452 transitions. Word has length 92 [2019-12-19 05:21:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:52,823 INFO L462 AbstractCegarLoop]: Abstraction has 2695 states and 6452 transitions. [2019-12-19 05:21:52,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:52,823 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 6452 transitions. [2019-12-19 05:21:52,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:52,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:52,826 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:21:52,827 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:52,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:52,827 INFO L82 PathProgramCache]: Analyzing trace with hash -947481435, now seen corresponding path program 2 times [2019-12-19 05:21:52,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:52,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792299655] [2019-12-19 05:21:52,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:52,926 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:21:52,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792299655] [2019-12-19 05:21:52,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:52,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:52,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102251222] [2019-12-19 05:21:52,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:52,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:52,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:52,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:52,929 INFO L87 Difference]: Start difference. First operand 2695 states and 6452 transitions. Second operand 7 states. [2019-12-19 05:21:53,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:53,321 INFO L93 Difference]: Finished difference Result 3871 states and 9108 transitions. [2019-12-19 05:21:53,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:21:53,323 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:21:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:53,329 INFO L225 Difference]: With dead ends: 3871 [2019-12-19 05:21:53,329 INFO L226 Difference]: Without dead ends: 3853 [2019-12-19 05:21:53,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:21:53,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-12-19 05:21:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3378. [2019-12-19 05:21:53,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3378 states. [2019-12-19 05:21:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 7977 transitions. [2019-12-19 05:21:53,388 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 7977 transitions. Word has length 92 [2019-12-19 05:21:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:53,388 INFO L462 AbstractCegarLoop]: Abstraction has 3378 states and 7977 transitions. [2019-12-19 05:21:53,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 7977 transitions. [2019-12-19 05:21:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:53,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:53,394 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:21:53,395 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:53,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:53,395 INFO L82 PathProgramCache]: Analyzing trace with hash 14132582, now seen corresponding path program 1 times [2019-12-19 05:21:53,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:53,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345493697] [2019-12-19 05:21:53,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:53,516 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:21:53,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345493697] [2019-12-19 05:21:53,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:53,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:21:53,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168986360] [2019-12-19 05:21:53,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:21:53,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:53,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:21:53,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:21:53,522 INFO L87 Difference]: Start difference. First operand 3378 states and 7977 transitions. Second operand 7 states. [2019-12-19 05:21:54,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:54,074 INFO L93 Difference]: Finished difference Result 4287 states and 10155 transitions. [2019-12-19 05:21:54,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:21:54,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:21:54,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:54,082 INFO L225 Difference]: With dead ends: 4287 [2019-12-19 05:21:54,082 INFO L226 Difference]: Without dead ends: 4287 [2019-12-19 05:21:54,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-19 05:21:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-12-19 05:21:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3600. [2019-12-19 05:21:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2019-12-19 05:21:54,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 8531 transitions. [2019-12-19 05:21:54,140 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 8531 transitions. Word has length 92 [2019-12-19 05:21:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:54,141 INFO L462 AbstractCegarLoop]: Abstraction has 3600 states and 8531 transitions. [2019-12-19 05:21:54,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:21:54,141 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 8531 transitions. [2019-12-19 05:21:54,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:54,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:54,146 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:21:54,146 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:54,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:54,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1258897063, now seen corresponding path program 1 times [2019-12-19 05:21:54,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:54,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909046272] [2019-12-19 05:21:54,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:54,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:54,254 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:21:54,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909046272] [2019-12-19 05:21:54,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:54,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:54,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747449484] [2019-12-19 05:21:54,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:54,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:54,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:54,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:54,256 INFO L87 Difference]: Start difference. First operand 3600 states and 8531 transitions. Second operand 6 states. [2019-12-19 05:21:54,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:54,538 INFO L93 Difference]: Finished difference Result 3968 states and 9363 transitions. [2019-12-19 05:21:54,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:21:54,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:21:54,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:54,544 INFO L225 Difference]: With dead ends: 3968 [2019-12-19 05:21:54,545 INFO L226 Difference]: Without dead ends: 3968 [2019-12-19 05:21:54,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:54,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-12-19 05:21:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3572. [2019-12-19 05:21:54,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-12-19 05:21:54,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 8475 transitions. [2019-12-19 05:21:54,581 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 8475 transitions. Word has length 92 [2019-12-19 05:21:54,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:54,581 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 8475 transitions. [2019-12-19 05:21:54,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:54,581 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 8475 transitions. [2019-12-19 05:21:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:54,584 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:54,585 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:21:54,585 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:54,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:54,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1311094677, now seen corresponding path program 1 times [2019-12-19 05:21:54,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:54,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539887421] [2019-12-19 05:21:54,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:54,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:54,679 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:21:54,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539887421] [2019-12-19 05:21:54,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:54,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:54,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212318947] [2019-12-19 05:21:54,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:54,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:54,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:54,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:54,681 INFO L87 Difference]: Start difference. First operand 3572 states and 8475 transitions. Second operand 6 states. [2019-12-19 05:21:54,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:54,944 INFO L93 Difference]: Finished difference Result 4056 states and 9312 transitions. [2019-12-19 05:21:54,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:21:54,945 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:21:54,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:54,950 INFO L225 Difference]: With dead ends: 4056 [2019-12-19 05:21:54,951 INFO L226 Difference]: Without dead ends: 4056 [2019-12-19 05:21:54,951 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:21:54,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-19 05:21:55,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3770. [2019-12-19 05:21:55,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3770 states. [2019-12-19 05:21:55,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 8757 transitions. [2019-12-19 05:21:55,027 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 8757 transitions. Word has length 92 [2019-12-19 05:21:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:55,028 INFO L462 AbstractCegarLoop]: Abstraction has 3770 states and 8757 transitions. [2019-12-19 05:21:55,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 8757 transitions. [2019-12-19 05:21:55,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:55,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:55,035 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:21:55,036 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:55,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:55,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1187021430, now seen corresponding path program 1 times [2019-12-19 05:21:55,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:55,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952690685] [2019-12-19 05:21:55,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:55,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:55,211 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:21:55,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952690685] [2019-12-19 05:21:55,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:55,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:21:55,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318330690] [2019-12-19 05:21:55,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:21:55,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:55,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:21:55,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:21:55,214 INFO L87 Difference]: Start difference. First operand 3770 states and 8757 transitions. Second operand 8 states. [2019-12-19 05:21:55,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:55,729 INFO L93 Difference]: Finished difference Result 4626 states and 10717 transitions. [2019-12-19 05:21:55,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:21:55,730 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-12-19 05:21:55,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:55,737 INFO L225 Difference]: With dead ends: 4626 [2019-12-19 05:21:55,737 INFO L226 Difference]: Without dead ends: 4608 [2019-12-19 05:21:55,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-19 05:21:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2019-12-19 05:21:55,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3251. [2019-12-19 05:21:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3251 states. [2019-12-19 05:21:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 7643 transitions. [2019-12-19 05:21:55,796 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 7643 transitions. Word has length 92 [2019-12-19 05:21:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:55,797 INFO L462 AbstractCegarLoop]: Abstraction has 3251 states and 7643 transitions. [2019-12-19 05:21:55,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:21:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 7643 transitions. [2019-12-19 05:21:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:55,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:55,801 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:21:55,801 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:55,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1019357068, now seen corresponding path program 1 times [2019-12-19 05:21:55,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:55,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436063931] [2019-12-19 05:21:55,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:55,932 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:21:55,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436063931] [2019-12-19 05:21:55,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:55,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:55,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409003709] [2019-12-19 05:21:55,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:55,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:55,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:55,941 INFO L87 Difference]: Start difference. First operand 3251 states and 7643 transitions. Second operand 5 states. [2019-12-19 05:21:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:55,990 INFO L93 Difference]: Finished difference Result 4760 states and 11424 transitions. [2019-12-19 05:21:55,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:21:55,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:21:55,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:55,999 INFO L225 Difference]: With dead ends: 4760 [2019-12-19 05:21:56,000 INFO L226 Difference]: Without dead ends: 4760 [2019-12-19 05:21:56,002 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:21:56,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2019-12-19 05:21:56,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 2893. [2019-12-19 05:21:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-12-19 05:21:56,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 6764 transitions. [2019-12-19 05:21:56,062 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 6764 transitions. Word has length 92 [2019-12-19 05:21:56,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:56,063 INFO L462 AbstractCegarLoop]: Abstraction has 2893 states and 6764 transitions. [2019-12-19 05:21:56,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:56,063 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 6764 transitions. [2019-12-19 05:21:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:21:56,066 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:56,066 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:21:56,067 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:56,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1500073484, now seen corresponding path program 1 times [2019-12-19 05:21:56,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:56,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921174252] [2019-12-19 05:21:56,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:56,171 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:21:56,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921174252] [2019-12-19 05:21:56,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:56,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:21:56,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395788597] [2019-12-19 05:21:56,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:21:56,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:56,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:21:56,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:21:56,173 INFO L87 Difference]: Start difference. First operand 2893 states and 6764 transitions. Second operand 6 states. [2019-12-19 05:21:56,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:56,354 INFO L93 Difference]: Finished difference Result 2650 states and 6062 transitions. [2019-12-19 05:21:56,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:21:56,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:21:56,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:56,359 INFO L225 Difference]: With dead ends: 2650 [2019-12-19 05:21:56,359 INFO L226 Difference]: Without dead ends: 2650 [2019-12-19 05:21:56,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:21:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-12-19 05:21:56,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2018. [2019-12-19 05:21:56,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-12-19 05:21:56,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 4736 transitions. [2019-12-19 05:21:56,382 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 4736 transitions. Word has length 92 [2019-12-19 05:21:56,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:56,382 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 4736 transitions. [2019-12-19 05:21:56,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:21:56,382 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 4736 transitions. [2019-12-19 05:21:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:56,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:56,384 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:21:56,384 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:56,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:56,384 INFO L82 PathProgramCache]: Analyzing trace with hash -572704409, now seen corresponding path program 1 times [2019-12-19 05:21:56,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:56,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286519240] [2019-12-19 05:21:56,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:56,459 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:21:56,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286519240] [2019-12-19 05:21:56,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:56,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:21:56,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672455798] [2019-12-19 05:21:56,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:21:56,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:21:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:21:56,461 INFO L87 Difference]: Start difference. First operand 2018 states and 4736 transitions. Second operand 5 states. [2019-12-19 05:21:56,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:56,666 INFO L93 Difference]: Finished difference Result 2270 states and 5315 transitions. [2019-12-19 05:21:56,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:21:56,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:21:56,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:56,669 INFO L225 Difference]: With dead ends: 2270 [2019-12-19 05:21:56,669 INFO L226 Difference]: Without dead ends: 2252 [2019-12-19 05:21:56,670 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:21:56,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-12-19 05:21:56,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2045. [2019-12-19 05:21:56,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-19 05:21:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4790 transitions. [2019-12-19 05:21:56,690 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4790 transitions. Word has length 94 [2019-12-19 05:21:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:56,690 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4790 transitions. [2019-12-19 05:21:56,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:21:56,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4790 transitions. [2019-12-19 05:21:56,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:56,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:56,692 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:21:56,693 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:56,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:56,693 INFO L82 PathProgramCache]: Analyzing trace with hash 672060072, now seen corresponding path program 1 times [2019-12-19 05:21:56,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:56,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963141054] [2019-12-19 05:21:56,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:21:56,827 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:21:56,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963141054] [2019-12-19 05:21:56,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:21:56,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 05:21:56,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833982206] [2019-12-19 05:21:56,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 05:21:56,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:21:56,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 05:21:56,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:21:56,829 INFO L87 Difference]: Start difference. First operand 2045 states and 4790 transitions. Second operand 11 states. [2019-12-19 05:21:57,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:21:57,092 INFO L93 Difference]: Finished difference Result 3214 states and 7655 transitions. [2019-12-19 05:21:57,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:21:57,092 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-19 05:21:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:21:57,096 INFO L225 Difference]: With dead ends: 3214 [2019-12-19 05:21:57,096 INFO L226 Difference]: Without dead ends: 2575 [2019-12-19 05:21:57,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 05:21:57,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-19 05:21:57,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2463. [2019-12-19 05:21:57,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-19 05:21:57,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5707 transitions. [2019-12-19 05:21:57,120 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5707 transitions. Word has length 94 [2019-12-19 05:21:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:21:57,120 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5707 transitions. [2019-12-19 05:21:57,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 05:21:57,121 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5707 transitions. [2019-12-19 05:21:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:21:57,123 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:21:57,123 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:21:57,123 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:21:57,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:21:57,123 INFO L82 PathProgramCache]: Analyzing trace with hash 718924530, now seen corresponding path program 2 times [2019-12-19 05:21:57,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:21:57,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150671424] [2019-12-19 05:21:57,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:21:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:21:57,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:21:57,209 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:21:57,209 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:21:57,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:21:57 BasicIcfg [2019-12-19 05:21:57,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:21:57,355 INFO L168 Benchmark]: Toolchain (without parser) took 65099.81 ms. Allocated memory was 145.2 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.3 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-19 05:21:57,356 INFO L168 Benchmark]: CDTParser took 1.55 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-19 05:21:57,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.36 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 157.3 MB in the end (delta: -57.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:57,356 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.15 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 153.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:57,357 INFO L168 Benchmark]: Boogie Preprocessor took 35.02 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:57,357 INFO L168 Benchmark]: RCFGBuilder took 744.34 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 108.0 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-19 05:21:57,358 INFO L168 Benchmark]: TraceAbstraction took 63446.24 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 107.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-19 05:21:57,360 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.55 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.36 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.1 MB in the beginning and 157.3 MB in the end (delta: -57.2 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.15 ms. Allocated memory is still 202.9 MB. Free memory was 157.3 MB in the beginning and 153.9 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.02 ms. Allocated memory is still 202.9 MB. Free memory was 153.9 MB in the beginning and 151.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 744.34 ms. Allocated memory is still 202.9 MB. Free memory was 151.9 MB in the beginning and 108.0 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 63446.24 ms. Allocated memory was 202.9 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 107.4 MB in the beginning and 1.4 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.3 GB. 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] [L700] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L701] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L702] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L703] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L704] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L705] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L706] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L707] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L708] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L709] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L710] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L711] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L712] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L713] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L714] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 0 pthread_t t2481; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 1 y$w_buff1 = y$w_buff0 [L721] 1 y$w_buff0 = 2 [L722] 1 y$w_buff1_used = y$w_buff0_used [L723] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2482; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2482, ((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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y 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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L786] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] EXPR 0 y$flush_delayed ? y$mem_tmp : y 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, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y = y$flush_delayed ? y$mem_tmp : y [L805] 0 y$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, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 63.1s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 25.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10101 SDtfs, 10205 SDslu, 24189 SDs, 0 SdLazy, 11136 SolverSat, 648 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 109 SyntacticMatches, 18 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76085occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 31.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 153176 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2914 NumberOfCodeBlocks, 2914 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2783 ConstructedInterpolants, 0 QuantifiedInterpolants, 519871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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...