/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9b7772ad7705253c1305067fc38dc9bc7271fbe3-9b7772a [2021-04-15 01:04:57,914 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-04-15 01:04:57,915 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-04-15 01:04:57,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-04-15 01:04:57,953 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-04-15 01:04:57,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-04-15 01:04:57,959 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-04-15 01:04:57,965 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-04-15 01:04:57,967 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-04-15 01:04:57,973 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-04-15 01:04:57,974 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-04-15 01:04:57,975 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-04-15 01:04:57,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-04-15 01:04:57,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-04-15 01:04:57,976 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-04-15 01:04:57,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-04-15 01:04:57,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-04-15 01:04:57,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-04-15 01:04:57,980 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-04-15 01:04:57,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-04-15 01:04:57,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-04-15 01:04:57,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-04-15 01:04:57,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-04-15 01:04:57,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-04-15 01:04:58,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-04-15 01:04:58,008 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-04-15 01:04:58,008 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-04-15 01:04:58,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-04-15 01:04:58,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-04-15 01:04:58,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-04-15 01:04:58,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-04-15 01:04:58,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-04-15 01:04:58,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-04-15 01:04:58,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-04-15 01:04:58,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-04-15 01:04:58,016 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-04-15 01:04:58,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-04-15 01:04:58,017 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-04-15 01:04:58,017 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-04-15 01:04:58,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-04-15 01:04:58,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-04-15 01:04:58,022 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 [2021-04-15 01:04:58,058 INFO L113 SettingsManager]: Loading preferences was successful [2021-04-15 01:04:58,058 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-04-15 01:04:58,058 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-04-15 01:04:58,058 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-04-15 01:04:58,059 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-04-15 01:04:58,059 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-04-15 01:04:58,060 INFO L138 SettingsManager]: * Use SBE=true [2021-04-15 01:04:58,060 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-04-15 01:04:58,060 INFO L138 SettingsManager]: * sizeof long=4 [2021-04-15 01:04:58,060 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-04-15 01:04:58,060 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-04-15 01:04:58,060 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-04-15 01:04:58,061 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-04-15 01:04:58,061 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-04-15 01:04:58,061 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-04-15 01:04:58,061 INFO L138 SettingsManager]: * sizeof long double=12 [2021-04-15 01:04:58,061 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-04-15 01:04:58,061 INFO L138 SettingsManager]: * Use constant arrays=true [2021-04-15 01:04:58,061 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-04-15 01:04:58,062 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-04-15 01:04:58,062 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-04-15 01:04:58,062 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-04-15 01:04:58,062 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-04-15 01:04:58,062 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-04-15 01:04:58,062 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-04-15 01:04:58,062 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-04-15 01:04:58,063 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-04-15 01:04:58,063 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-04-15 01:04:58,063 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-04-15 01:04:58,063 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-04-15 01:04:58,063 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-04-15 01:04:58,063 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2021-04-15 01:04:58,369 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-04-15 01:04:58,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-04-15 01:04:58,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-04-15 01:04:58,398 INFO L271 PluginConnector]: Initializing CDTParser... [2021-04-15 01:04:58,398 INFO L275 PluginConnector]: CDTParser initialized [2021-04-15 01:04:58,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2021-04-15 01:04:58,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167e184de/b91bc46290b74321ad694530e2eebd0d/FLAG6e47e87e4 [2021-04-15 01:04:59,308 INFO L306 CDTParser]: Found 1 translation units. [2021-04-15 01:04:59,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i [2021-04-15 01:04:59,336 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167e184de/b91bc46290b74321ad694530e2eebd0d/FLAG6e47e87e4 [2021-04-15 01:04:59,464 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/167e184de/b91bc46290b74321ad694530e2eebd0d [2021-04-15 01:04:59,466 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-04-15 01:04:59,471 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-04-15 01:04:59,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-04-15 01:04:59,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-04-15 01:04:59,477 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-04-15 01:04:59,478 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:04:59,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c7570c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59, skipping insertion in model container [2021-04-15 01:04:59,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:04:59,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-04-15 01:04:59,522 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-04-15 01:04:59,660 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i[949,962] [2021-04-15 01:04:59,839 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 01:04:59,846 INFO L203 MainTranslator]: Completed pre-run [2021-04-15 01:04:59,856 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe030_pso.opt.i[949,962] [2021-04-15 01:04:59,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-04-15 01:04:59,974 INFO L208 MainTranslator]: Completed translation [2021-04-15 01:04:59,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59 WrapperNode [2021-04-15 01:04:59,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-04-15 01:04:59,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-04-15 01:04:59,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-04-15 01:04:59,978 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-04-15 01:04:59,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,001 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,026 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-04-15 01:05:00,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-04-15 01:05:00,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-04-15 01:05:00,028 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-04-15 01:05:00,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,035 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,038 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,039 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (1/1) ... [2021-04-15 01:05:00,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-04-15 01:05:00,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-04-15 01:05:00,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-04-15 01:05:00,058 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-04-15 01:05:00,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (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 [2021-04-15 01:05:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-04-15 01:05:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-04-15 01:05:00,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-04-15 01:05:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-04-15 01:05:00,120 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-04-15 01:05:00,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-04-15 01:05:00,122 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-04-15 01:05:00,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-04-15 01:05:00,122 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-04-15 01:05:00,122 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-04-15 01:05:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-04-15 01:05:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-04-15 01:05:00,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-04-15 01:05:00,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-04-15 01:05:00,124 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-04-15 01:05:01,732 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-04-15 01:05:01,732 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-04-15 01:05:01,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:01 BoogieIcfgContainer [2021-04-15 01:05:01,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-04-15 01:05:01,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-04-15 01:05:01,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-04-15 01:05:01,739 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-04-15 01:05:01,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 01:04:59" (1/3) ... [2021-04-15 01:05:01,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e8bad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:01, skipping insertion in model container [2021-04-15 01:05:01,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 01:04:59" (2/3) ... [2021-04-15 01:05:01,740 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53e8bad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 01:05:01, skipping insertion in model container [2021-04-15 01:05:01,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 01:05:01" (3/3) ... [2021-04-15 01:05:01,742 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_pso.opt.i [2021-04-15 01:05:01,748 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-04-15 01:05:01,748 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-04-15 01:05:01,752 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-04-15 01:05:01,753 INFO L323 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-04-15 01:05:01,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,790 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,790 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,790 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,791 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,791 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,792 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,792 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,792 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,792 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,793 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,793 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,794 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,795 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,796 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,796 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,796 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,796 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,796 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,797 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,797 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,798 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,799 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,800 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,802 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,804 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,804 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,804 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,811 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,811 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,811 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,815 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-04-15 01:05:01,817 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-04-15 01:05:01,832 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-04-15 01:05:01,861 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-04-15 01:05:01,865 INFO L377 AbstractCegarLoop]: Hoare is true [2021-04-15 01:05:01,866 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-04-15 01:05:01,866 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-04-15 01:05:01,866 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-04-15 01:05:01,866 INFO L381 AbstractCegarLoop]: Difference is false [2021-04-15 01:05:01,866 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-04-15 01:05:01,866 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-04-15 01:05:01,877 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 95 transitions, 205 flow [2021-04-15 01:05:02,691 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 13392 states, 13388 states have (on average 3.634149985061249) internal successors, (48654), 13391 states have internal predecessors, (48654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:02,727 INFO L276 IsEmpty]: Start isEmpty. Operand has 13392 states, 13388 states have (on average 3.634149985061249) internal successors, (48654), 13391 states have internal predecessors, (48654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-04-15 01:05:02,741 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:02,742 INFO L551 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] [2021-04-15 01:05:02,742 INFO L428 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:02,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:02,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1287208224, now seen corresponding path program 1 times [2021-04-15 01:05:02,764 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:02,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937745015] [2021-04-15 01:05:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:02,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:03,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:03,102 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937745015] [2021-04-15 01:05:03,102 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:03,102 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-04-15 01:05:03,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084154089] [2021-04-15 01:05:03,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-04-15 01:05:03,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:03,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-04-15 01:05:03,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 01:05:03,146 INFO L87 Difference]: Start difference. First operand has 13392 states, 13388 states have (on average 3.634149985061249) internal successors, (48654), 13391 states have internal predecessors, (48654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:03,400 INFO L93 Difference]: Finished difference Result 11488 states and 40652 transitions. [2021-04-15 01:05:03,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-04-15 01:05:03,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-04-15 01:05:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:03,484 INFO L225 Difference]: With dead ends: 11488 [2021-04-15 01:05:03,484 INFO L226 Difference]: Without dead ends: 6560 [2021-04-15 01:05:03,485 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-04-15 01:05:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6560 states. [2021-04-15 01:05:03,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6560 to 6560. [2021-04-15 01:05:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6560 states, 6559 states have (on average 3.487726787620064) internal successors, (22876), 6559 states have internal predecessors, (22876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6560 states to 6560 states and 22876 transitions. [2021-04-15 01:05:03,887 INFO L78 Accepts]: Start accepts. Automaton has 6560 states and 22876 transitions. Word has length 46 [2021-04-15 01:05:03,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:03,888 INFO L480 AbstractCegarLoop]: Abstraction has 6560 states and 22876 transitions. [2021-04-15 01:05:03,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:03,889 INFO L276 IsEmpty]: Start isEmpty. Operand 6560 states and 22876 transitions. [2021-04-15 01:05:03,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-04-15 01:05:03,903 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:03,903 INFO L551 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] [2021-04-15 01:05:03,903 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-04-15 01:05:03,903 INFO L428 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:03,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:03,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1259649930, now seen corresponding path program 1 times [2021-04-15 01:05:03,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:03,907 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328651049] [2021-04-15 01:05:03,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:04,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:04,123 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328651049] [2021-04-15 01:05:04,124 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:04,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:04,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382026610] [2021-04-15 01:05:04,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:04,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:04,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:04,127 INFO L87 Difference]: Start difference. First operand 6560 states and 22876 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:04,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:04,383 INFO L93 Difference]: Finished difference Result 8064 states and 27824 transitions. [2021-04-15 01:05:04,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:04,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-04-15 01:05:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:04,424 INFO L225 Difference]: With dead ends: 8064 [2021-04-15 01:05:04,424 INFO L226 Difference]: Without dead ends: 6272 [2021-04-15 01:05:04,426 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 100.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6272 states. [2021-04-15 01:05:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6272 to 6272. [2021-04-15 01:05:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6272 states, 6271 states have (on average 3.4699409982458937) internal successors, (21760), 6271 states have internal predecessors, (21760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:04,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6272 states to 6272 states and 21760 transitions. [2021-04-15 01:05:04,630 INFO L78 Accepts]: Start accepts. Automaton has 6272 states and 21760 transitions. Word has length 57 [2021-04-15 01:05:04,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:04,632 INFO L480 AbstractCegarLoop]: Abstraction has 6272 states and 21760 transitions. [2021-04-15 01:05:04,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 6272 states and 21760 transitions. [2021-04-15 01:05:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-04-15 01:05:04,732 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:04,732 INFO L551 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] [2021-04-15 01:05:04,732 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-04-15 01:05:04,732 INFO L428 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:04,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:04,733 INFO L82 PathProgramCache]: Analyzing trace with hash 437085673, now seen corresponding path program 1 times [2021-04-15 01:05:04,733 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:04,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161345682] [2021-04-15 01:05:04,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:04,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:04,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161345682] [2021-04-15 01:05:04,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:04,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:04,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26678224] [2021-04-15 01:05:04,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:04,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:04,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:04,949 INFO L87 Difference]: Start difference. First operand 6272 states and 21760 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:05,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:05,133 INFO L93 Difference]: Finished difference Result 7656 states and 26288 transitions. [2021-04-15 01:05:05,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:05,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2021-04-15 01:05:05,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:05,178 INFO L225 Difference]: With dead ends: 7656 [2021-04-15 01:05:05,178 INFO L226 Difference]: Without dead ends: 6056 [2021-04-15 01:05:05,179 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 114.7ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:05,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2021-04-15 01:05:05,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 6056. [2021-04-15 01:05:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6056 states, 6055 states have (on average 3.4569777043765484) internal successors, (20932), 6055 states have internal predecessors, (20932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 20932 transitions. [2021-04-15 01:05:05,472 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 20932 transitions. Word has length 59 [2021-04-15 01:05:05,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:05,472 INFO L480 AbstractCegarLoop]: Abstraction has 6056 states and 20932 transitions. [2021-04-15 01:05:05,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:05,473 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 20932 transitions. [2021-04-15 01:05:05,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-04-15 01:05:05,486 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:05,487 INFO L551 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] [2021-04-15 01:05:05,487 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-04-15 01:05:05,488 INFO L428 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:05,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:05,490 INFO L82 PathProgramCache]: Analyzing trace with hash -92247609, now seen corresponding path program 1 times [2021-04-15 01:05:05,490 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:05,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928694035] [2021-04-15 01:05:05,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:05,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:05,650 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928694035] [2021-04-15 01:05:05,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:05,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:05,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053975384] [2021-04-15 01:05:05,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:05,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:05,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:05,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:05,652 INFO L87 Difference]: Start difference. First operand 6056 states and 20932 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:05,832 INFO L93 Difference]: Finished difference Result 10248 states and 34748 transitions. [2021-04-15 01:05:05,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:05,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2021-04-15 01:05:05,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:05,859 INFO L225 Difference]: With dead ends: 10248 [2021-04-15 01:05:05,859 INFO L226 Difference]: Without dead ends: 6824 [2021-04-15 01:05:05,859 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 101.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:05,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2021-04-15 01:05:06,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 5672. [2021-04-15 01:05:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5672 states, 5671 states have (on average 3.3736554399576795) internal successors, (19132), 5671 states have internal predecessors, (19132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:06,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5672 states to 5672 states and 19132 transitions. [2021-04-15 01:05:06,142 INFO L78 Accepts]: Start accepts. Automaton has 5672 states and 19132 transitions. Word has length 60 [2021-04-15 01:05:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:06,144 INFO L480 AbstractCegarLoop]: Abstraction has 5672 states and 19132 transitions. [2021-04-15 01:05:06,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5672 states and 19132 transitions. [2021-04-15 01:05:06,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-04-15 01:05:06,154 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:06,155 INFO L551 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] [2021-04-15 01:05:06,155 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-04-15 01:05:06,155 INFO L428 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:06,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:06,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1442304648, now seen corresponding path program 1 times [2021-04-15 01:05:06,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:06,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18187552] [2021-04-15 01:05:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:06,368 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18187552] [2021-04-15 01:05:06,368 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:06,368 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:06,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111118840] [2021-04-15 01:05:06,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:06,369 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:06,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:06,370 INFO L87 Difference]: Start difference. First operand 5672 states and 19132 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:06,736 INFO L93 Difference]: Finished difference Result 6614 states and 22172 transitions. [2021-04-15 01:05:06,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 01:05:06,737 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2021-04-15 01:05:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:06,763 INFO L225 Difference]: With dead ends: 6614 [2021-04-15 01:05:06,763 INFO L226 Difference]: Without dead ends: 5654 [2021-04-15 01:05:06,763 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 248.7ms TimeCoverageRelationStatistics Valid=98, Invalid=208, Unknown=0, NotChecked=0, Total=306 [2021-04-15 01:05:06,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5654 states. [2021-04-15 01:05:06,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5654 to 5612. [2021-04-15 01:05:06,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5612 states, 5611 states have (on average 3.3690964177508467) internal successors, (18904), 5611 states have internal predecessors, (18904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:06,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5612 states to 5612 states and 18904 transitions. [2021-04-15 01:05:06,913 INFO L78 Accepts]: Start accepts. Automaton has 5612 states and 18904 transitions. Word has length 61 [2021-04-15 01:05:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:06,914 INFO L480 AbstractCegarLoop]: Abstraction has 5612 states and 18904 transitions. [2021-04-15 01:05:06,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 5612 states and 18904 transitions. [2021-04-15 01:05:06,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:06,924 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:06,924 INFO L551 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] [2021-04-15 01:05:06,925 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-04-15 01:05:06,925 INFO L428 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:06,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:06,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1232588476, now seen corresponding path program 1 times [2021-04-15 01:05:06,925 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:06,925 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143611156] [2021-04-15 01:05:06,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:07,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143611156] [2021-04-15 01:05:07,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:07,113 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:07,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167952961] [2021-04-15 01:05:07,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:07,114 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:07,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:07,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:07,115 INFO L87 Difference]: Start difference. First operand 5612 states and 18904 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:07,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:07,531 INFO L93 Difference]: Finished difference Result 6166 states and 20644 transitions. [2021-04-15 01:05:07,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-04-15 01:05:07,532 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-04-15 01:05:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:07,547 INFO L225 Difference]: With dead ends: 6166 [2021-04-15 01:05:07,547 INFO L226 Difference]: Without dead ends: 5326 [2021-04-15 01:05:07,548 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 300.6ms TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:07,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5326 states. [2021-04-15 01:05:07,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5326 to 5312. [2021-04-15 01:05:07,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5312 states, 5311 states have (on average 3.3560534739220484) internal successors, (17824), 5311 states have internal predecessors, (17824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:07,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 17824 transitions. [2021-04-15 01:05:07,796 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 17824 transitions. Word has length 62 [2021-04-15 01:05:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:07,796 INFO L480 AbstractCegarLoop]: Abstraction has 5312 states and 17824 transitions. [2021-04-15 01:05:07,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:07,796 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 17824 transitions. [2021-04-15 01:05:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-04-15 01:05:07,809 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:07,809 INFO L551 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] [2021-04-15 01:05:07,809 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-04-15 01:05:07,810 INFO L428 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:07,810 INFO L82 PathProgramCache]: Analyzing trace with hash 711739705, now seen corresponding path program 1 times [2021-04-15 01:05:07,810 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:07,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451226859] [2021-04-15 01:05:07,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:07,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:07,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:07,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451226859] [2021-04-15 01:05:07,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:07,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:07,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755530] [2021-04-15 01:05:07,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:07,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:07,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:07,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:07,916 INFO L87 Difference]: Start difference. First operand 5312 states and 17824 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:08,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:08,042 INFO L93 Difference]: Finished difference Result 8892 states and 29418 transitions. [2021-04-15 01:05:08,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:08,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-04-15 01:05:08,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:08,056 INFO L225 Difference]: With dead ends: 8892 [2021-04-15 01:05:08,056 INFO L226 Difference]: Without dead ends: 5852 [2021-04-15 01:05:08,056 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 84.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:08,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5852 states. [2021-04-15 01:05:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5852 to 4952. [2021-04-15 01:05:08,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4952 states, 4951 states have (on average 3.2712583316501718) internal successors, (16196), 4951 states have internal predecessors, (16196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4952 states to 4952 states and 16196 transitions. [2021-04-15 01:05:08,180 INFO L78 Accepts]: Start accepts. Automaton has 4952 states and 16196 transitions. Word has length 62 [2021-04-15 01:05:08,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:08,181 INFO L480 AbstractCegarLoop]: Abstraction has 4952 states and 16196 transitions. [2021-04-15 01:05:08,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:08,181 INFO L276 IsEmpty]: Start isEmpty. Operand 4952 states and 16196 transitions. [2021-04-15 01:05:08,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 01:05:08,190 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:08,191 INFO L551 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] [2021-04-15 01:05:08,191 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-04-15 01:05:08,191 INFO L428 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:08,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:08,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1661309482, now seen corresponding path program 1 times [2021-04-15 01:05:08,191 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:08,192 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152495177] [2021-04-15 01:05:08,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:08,359 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152495177] [2021-04-15 01:05:08,360 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:08,360 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 01:05:08,360 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847836916] [2021-04-15 01:05:08,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 01:05:08,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:08,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 01:05:08,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-04-15 01:05:08,361 INFO L87 Difference]: Start difference. First operand 4952 states and 16196 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:08,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:08,814 INFO L93 Difference]: Finished difference Result 5798 states and 18892 transitions. [2021-04-15 01:05:08,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-04-15 01:05:08,814 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-04-15 01:05:08,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:08,826 INFO L225 Difference]: With dead ends: 5798 [2021-04-15 01:05:08,826 INFO L226 Difference]: Without dead ends: 5078 [2021-04-15 01:05:08,826 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 333.1ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-04-15 01:05:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5078 states. [2021-04-15 01:05:08,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5078 to 5078. [2021-04-15 01:05:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5078 states, 5077 states have (on average 3.2609808942288754) internal successors, (16556), 5077 states have internal predecessors, (16556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:08,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5078 states to 5078 states and 16556 transitions. [2021-04-15 01:05:08,958 INFO L78 Accepts]: Start accepts. Automaton has 5078 states and 16556 transitions. Word has length 63 [2021-04-15 01:05:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:08,959 INFO L480 AbstractCegarLoop]: Abstraction has 5078 states and 16556 transitions. [2021-04-15 01:05:08,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 5078 states and 16556 transitions. [2021-04-15 01:05:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-04-15 01:05:08,967 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:08,967 INFO L551 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] [2021-04-15 01:05:08,968 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-04-15 01:05:08,968 INFO L428 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1298363050, now seen corresponding path program 2 times [2021-04-15 01:05:08,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:08,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059130669] [2021-04-15 01:05:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:09,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059130669] [2021-04-15 01:05:09,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:09,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:09,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272239801] [2021-04-15 01:05:09,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:09,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:09,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:09,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:09,172 INFO L87 Difference]: Start difference. First operand 5078 states and 16556 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:09,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:09,376 INFO L93 Difference]: Finished difference Result 5738 states and 18654 transitions. [2021-04-15 01:05:09,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:09,377 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-04-15 01:05:09,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:09,386 INFO L225 Difference]: With dead ends: 5738 [2021-04-15 01:05:09,387 INFO L226 Difference]: Without dead ends: 5018 [2021-04-15 01:05:09,387 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 171.0ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-04-15 01:05:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5018 states. [2021-04-15 01:05:09,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5018 to 5018. [2021-04-15 01:05:09,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5018 states, 5017 states have (on average 3.254534582419773) internal successors, (16328), 5017 states have internal predecessors, (16328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:09,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5018 states to 5018 states and 16328 transitions. [2021-04-15 01:05:09,515 INFO L78 Accepts]: Start accepts. Automaton has 5018 states and 16328 transitions. Word has length 63 [2021-04-15 01:05:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:09,515 INFO L480 AbstractCegarLoop]: Abstraction has 5018 states and 16328 transitions. [2021-04-15 01:05:09,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 5018 states and 16328 transitions. [2021-04-15 01:05:09,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 01:05:09,527 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:09,527 INFO L551 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] [2021-04-15 01:05:09,527 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-04-15 01:05:09,527 INFO L428 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:09,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:09,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1987531102, now seen corresponding path program 1 times [2021-04-15 01:05:09,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:09,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341398034] [2021-04-15 01:05:09,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:09,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:09,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:09,686 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341398034] [2021-04-15 01:05:09,686 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:09,686 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-04-15 01:05:09,686 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374848237] [2021-04-15 01:05:09,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-04-15 01:05:09,687 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:09,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-04-15 01:05:09,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-04-15 01:05:09,687 INFO L87 Difference]: Start difference. First operand 5018 states and 16328 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:09,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:09,974 INFO L93 Difference]: Finished difference Result 5642 states and 18304 transitions. [2021-04-15 01:05:09,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 01:05:09,975 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-04-15 01:05:09,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:09,985 INFO L225 Difference]: With dead ends: 5642 [2021-04-15 01:05:09,985 INFO L226 Difference]: Without dead ends: 5042 [2021-04-15 01:05:09,985 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 157.1ms TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2021-04-15 01:05:09,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5042 states. [2021-04-15 01:05:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5042 to 4962. [2021-04-15 01:05:10,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4962 states, 4961 states have (on average 3.2537794799435598) internal successors, (16142), 4961 states have internal predecessors, (16142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4962 states to 4962 states and 16142 transitions. [2021-04-15 01:05:10,098 INFO L78 Accepts]: Start accepts. Automaton has 4962 states and 16142 transitions. Word has length 64 [2021-04-15 01:05:10,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:10,099 INFO L480 AbstractCegarLoop]: Abstraction has 4962 states and 16142 transitions. [2021-04-15 01:05:10,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:10,099 INFO L276 IsEmpty]: Start isEmpty. Operand 4962 states and 16142 transitions. [2021-04-15 01:05:10,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-04-15 01:05:10,108 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:10,108 INFO L551 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] [2021-04-15 01:05:10,108 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-04-15 01:05:10,108 INFO L428 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:10,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1624584670, now seen corresponding path program 2 times [2021-04-15 01:05:10,108 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:10,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094047232] [2021-04-15 01:05:10,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:10,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:10,272 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094047232] [2021-04-15 01:05:10,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:10,273 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-04-15 01:05:10,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759684587] [2021-04-15 01:05:10,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-04-15 01:05:10,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:10,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-04-15 01:05:10,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-04-15 01:05:10,275 INFO L87 Difference]: Start difference. First operand 4962 states and 16142 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:10,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:10,527 INFO L93 Difference]: Finished difference Result 5926 states and 19272 transitions. [2021-04-15 01:05:10,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:05:10,527 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-04-15 01:05:10,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:10,538 INFO L225 Difference]: With dead ends: 5926 [2021-04-15 01:05:10,539 INFO L226 Difference]: Without dead ends: 5246 [2021-04-15 01:05:10,539 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 191.1ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-04-15 01:05:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2021-04-15 01:05:10,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 5056. [2021-04-15 01:05:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5056 states, 5055 states have (on average 3.2617210682492583) internal successors, (16488), 5055 states have internal predecessors, (16488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:10,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5056 states to 5056 states and 16488 transitions. [2021-04-15 01:05:10,654 INFO L78 Accepts]: Start accepts. Automaton has 5056 states and 16488 transitions. Word has length 64 [2021-04-15 01:05:10,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:10,654 INFO L480 AbstractCegarLoop]: Abstraction has 5056 states and 16488 transitions. [2021-04-15 01:05:10,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:10,655 INFO L276 IsEmpty]: Start isEmpty. Operand 5056 states and 16488 transitions. [2021-04-15 01:05:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 01:05:10,664 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:10,664 INFO L551 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] [2021-04-15 01:05:10,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-04-15 01:05:10,664 INFO L428 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:10,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash 568809131, now seen corresponding path program 1 times [2021-04-15 01:05:10,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:10,665 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056654276] [2021-04-15 01:05:10,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:10,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056654276] [2021-04-15 01:05:10,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:10,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 01:05:10,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18578818] [2021-04-15 01:05:10,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 01:05:10,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:10,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 01:05:10,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-04-15 01:05:10,876 INFO L87 Difference]: Start difference. First operand 5056 states and 16488 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:11,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:11,161 INFO L93 Difference]: Finished difference Result 6168 states and 19850 transitions. [2021-04-15 01:05:11,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:11,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-04-15 01:05:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:11,171 INFO L225 Difference]: With dead ends: 6168 [2021-04-15 01:05:11,171 INFO L226 Difference]: Without dead ends: 5488 [2021-04-15 01:05:11,172 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 201.6ms TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2021-04-15 01:05:11,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5488 states. [2021-04-15 01:05:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5488 to 5246. [2021-04-15 01:05:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5246 states, 5245 states have (on average 3.22745471877979) internal successors, (16928), 5245 states have internal predecessors, (16928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5246 states to 5246 states and 16928 transitions. [2021-04-15 01:05:11,338 INFO L78 Accepts]: Start accepts. Automaton has 5246 states and 16928 transitions. Word has length 65 [2021-04-15 01:05:11,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:11,338 INFO L480 AbstractCegarLoop]: Abstraction has 5246 states and 16928 transitions. [2021-04-15 01:05:11,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 16928 transitions. [2021-04-15 01:05:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 01:05:11,349 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:11,349 INFO L551 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] [2021-04-15 01:05:11,349 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-04-15 01:05:11,349 INFO L428 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 205862699, now seen corresponding path program 2 times [2021-04-15 01:05:11,350 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:11,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565176452] [2021-04-15 01:05:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:11,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:11,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:11,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565176452] [2021-04-15 01:05:11,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:11,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-04-15 01:05:11,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135441545] [2021-04-15 01:05:11,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-04-15 01:05:11,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:11,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-04-15 01:05:11,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2021-04-15 01:05:11,646 INFO L87 Difference]: Start difference. First operand 5246 states and 16928 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:11,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:11,874 INFO L93 Difference]: Finished difference Result 6146 states and 19653 transitions. [2021-04-15 01:05:11,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-04-15 01:05:11,875 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-04-15 01:05:11,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:11,883 INFO L225 Difference]: With dead ends: 6146 [2021-04-15 01:05:11,884 INFO L226 Difference]: Without dead ends: 5221 [2021-04-15 01:05:11,884 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 244.7ms TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2021-04-15 01:05:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2021-04-15 01:05:11,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 4811. [2021-04-15 01:05:11,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4811 states, 4810 states have (on average 3.238877338877339) internal successors, (15579), 4810 states have internal predecessors, (15579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:11,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 15579 transitions. [2021-04-15 01:05:11,992 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 15579 transitions. Word has length 65 [2021-04-15 01:05:11,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:11,993 INFO L480 AbstractCegarLoop]: Abstraction has 4811 states and 15579 transitions. [2021-04-15 01:05:11,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:11,993 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 15579 transitions. [2021-04-15 01:05:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 01:05:12,001 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:12,002 INFO L551 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] [2021-04-15 01:05:12,002 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-04-15 01:05:12,002 INFO L428 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:12,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:12,002 INFO L82 PathProgramCache]: Analyzing trace with hash -118520257, now seen corresponding path program 3 times [2021-04-15 01:05:12,002 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:12,003 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457692126] [2021-04-15 01:05:12,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:12,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:12,213 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457692126] [2021-04-15 01:05:12,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:12,214 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-04-15 01:05:12,214 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758679973] [2021-04-15 01:05:12,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-04-15 01:05:12,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:12,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-04-15 01:05:12,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2021-04-15 01:05:12,215 INFO L87 Difference]: Start difference. First operand 4811 states and 15579 transitions. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:12,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:12,489 INFO L93 Difference]: Finished difference Result 5720 states and 18327 transitions. [2021-04-15 01:05:12,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:12,489 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-04-15 01:05:12,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:12,498 INFO L225 Difference]: With dead ends: 5720 [2021-04-15 01:05:12,498 INFO L226 Difference]: Without dead ends: 4950 [2021-04-15 01:05:12,498 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 224.1ms TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4950 states. [2021-04-15 01:05:12,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4950 to 4756. [2021-04-15 01:05:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4756 states, 4755 states have (on average 3.237223974763407) internal successors, (15393), 4755 states have internal predecessors, (15393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4756 states to 4756 states and 15393 transitions. [2021-04-15 01:05:12,596 INFO L78 Accepts]: Start accepts. Automaton has 4756 states and 15393 transitions. Word has length 65 [2021-04-15 01:05:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:12,597 INFO L480 AbstractCegarLoop]: Abstraction has 4756 states and 15393 transitions. [2021-04-15 01:05:12,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 4756 states and 15393 transitions. [2021-04-15 01:05:12,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 01:05:12,605 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:12,606 INFO L551 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] [2021-04-15 01:05:12,606 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-04-15 01:05:12,606 INFO L428 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:12,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:12,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1077049877, now seen corresponding path program 4 times [2021-04-15 01:05:12,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:12,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151640855] [2021-04-15 01:05:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:12,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:12,820 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151640855] [2021-04-15 01:05:12,820 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:12,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-04-15 01:05:12,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423855565] [2021-04-15 01:05:12,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-04-15 01:05:12,821 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:12,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-04-15 01:05:12,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-04-15 01:05:12,822 INFO L87 Difference]: Start difference. First operand 4756 states and 15393 transitions. Second operand has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,153 INFO L93 Difference]: Finished difference Result 6812 states and 21819 transitions. [2021-04-15 01:05:13,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-04-15 01:05:13,154 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-04-15 01:05:13,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,163 INFO L225 Difference]: With dead ends: 6812 [2021-04-15 01:05:13,163 INFO L226 Difference]: Without dead ends: 4252 [2021-04-15 01:05:13,163 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 275.7ms TimeCoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2021-04-15 01:05:13,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4252 states. [2021-04-15 01:05:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4252 to 3452. [2021-04-15 01:05:13,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3452 states, 3451 states have (on average 3.202549985511446) internal successors, (11052), 3451 states have internal predecessors, (11052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3452 states to 3452 states and 11052 transitions. [2021-04-15 01:05:13,245 INFO L78 Accepts]: Start accepts. Automaton has 3452 states and 11052 transitions. Word has length 65 [2021-04-15 01:05:13,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,245 INFO L480 AbstractCegarLoop]: Abstraction has 3452 states and 11052 transitions. [2021-04-15 01:05:13,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.416666666666667) internal successors, (65), 12 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3452 states and 11052 transitions. [2021-04-15 01:05:13,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-04-15 01:05:13,253 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,254 INFO L551 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] [2021-04-15 01:05:13,254 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-04-15 01:05:13,254 INFO L428 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1739234197, now seen corresponding path program 1 times [2021-04-15 01:05:13,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,254 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035381101] [2021-04-15 01:05:13,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:13,333 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035381101] [2021-04-15 01:05:13,334 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,334 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-04-15 01:05:13,335 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175066944] [2021-04-15 01:05:13,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-04-15 01:05:13,335 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-04-15 01:05:13,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-04-15 01:05:13,336 INFO L87 Difference]: Start difference. First operand 3452 states and 11052 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,445 INFO L93 Difference]: Finished difference Result 4308 states and 13492 transitions. [2021-04-15 01:05:13,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-04-15 01:05:13,445 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-04-15 01:05:13,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,450 INFO L225 Difference]: With dead ends: 4308 [2021-04-15 01:05:13,450 INFO L226 Difference]: Without dead ends: 2996 [2021-04-15 01:05:13,450 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 82.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-04-15 01:05:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2021-04-15 01:05:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 2996. [2021-04-15 01:05:13,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2996 states, 2995 states have (on average 3.1312186978297163) internal successors, (9378), 2995 states have internal predecessors, (9378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2996 states to 2996 states and 9378 transitions. [2021-04-15 01:05:13,503 INFO L78 Accepts]: Start accepts. Automaton has 2996 states and 9378 transitions. Word has length 65 [2021-04-15 01:05:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,504 INFO L480 AbstractCegarLoop]: Abstraction has 2996 states and 9378 transitions. [2021-04-15 01:05:13,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 6 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 2996 states and 9378 transitions. [2021-04-15 01:05:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-04-15 01:05:13,509 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,510 INFO L551 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] [2021-04-15 01:05:13,510 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-04-15 01:05:13,510 INFO L428 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1298715173, now seen corresponding path program 1 times [2021-04-15 01:05:13,510 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731540939] [2021-04-15 01:05:13,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:13,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731540939] [2021-04-15 01:05:13,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-04-15 01:05:13,592 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278745473] [2021-04-15 01:05:13,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-04-15 01:05:13,592 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-04-15 01:05:13,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-04-15 01:05:13,593 INFO L87 Difference]: Start difference. First operand 2996 states and 9378 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:13,727 INFO L93 Difference]: Finished difference Result 3038 states and 9208 transitions. [2021-04-15 01:05:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-04-15 01:05:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-04-15 01:05:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:13,732 INFO L225 Difference]: With dead ends: 3038 [2021-04-15 01:05:13,732 INFO L226 Difference]: Without dead ends: 1982 [2021-04-15 01:05:13,733 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 98.5ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-04-15 01:05:13,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1982 states. [2021-04-15 01:05:13,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1982 to 1982. [2021-04-15 01:05:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1982 states, 1981 states have (on average 2.9813225643614336) internal successors, (5906), 1981 states have internal predecessors, (5906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 5906 transitions. [2021-04-15 01:05:13,772 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 5906 transitions. Word has length 66 [2021-04-15 01:05:13,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:13,772 INFO L480 AbstractCegarLoop]: Abstraction has 1982 states and 5906 transitions. [2021-04-15 01:05:13,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 7 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 5906 transitions. [2021-04-15 01:05:13,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2021-04-15 01:05:13,777 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:13,777 INFO L551 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] [2021-04-15 01:05:13,777 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-04-15 01:05:13,777 INFO L428 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:13,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:13,778 INFO L82 PathProgramCache]: Analyzing trace with hash 598027436, now seen corresponding path program 1 times [2021-04-15 01:05:13,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:13,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700653557] [2021-04-15 01:05:13,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-04-15 01:05:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-04-15 01:05:13,870 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700653557] [2021-04-15 01:05:13,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-04-15 01:05:13,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-04-15 01:05:13,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414353339] [2021-04-15 01:05:13,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-04-15 01:05:13,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-04-15 01:05:13,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-04-15 01:05:13,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-04-15 01:05:13,873 INFO L87 Difference]: Start difference. First operand 1982 states and 5906 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:14,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-04-15 01:05:14,022 INFO L93 Difference]: Finished difference Result 1568 states and 4499 transitions. [2021-04-15 01:05:14,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-04-15 01:05:14,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2021-04-15 01:05:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-04-15 01:05:14,024 INFO L225 Difference]: With dead ends: 1568 [2021-04-15 01:05:14,024 INFO L226 Difference]: Without dead ends: 644 [2021-04-15 01:05:14,025 INFO L807 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 123.3ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-04-15 01:05:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2021-04-15 01:05:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2021-04-15 01:05:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 643 states have (on average 2.7371695178849142) internal successors, (1760), 643 states have internal predecessors, (1760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 1760 transitions. [2021-04-15 01:05:14,035 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 1760 transitions. Word has length 68 [2021-04-15 01:05:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-04-15 01:05:14,035 INFO L480 AbstractCegarLoop]: Abstraction has 644 states and 1760 transitions. [2021-04-15 01:05:14,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-04-15 01:05:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 1760 transitions. [2021-04-15 01:05:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-04-15 01:05:14,036 INFO L543 BasicCegarLoop]: Found error trace [2021-04-15 01:05:14,037 INFO L551 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] [2021-04-15 01:05:14,037 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-04-15 01:05:14,037 INFO L428 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-04-15 01:05:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-04-15 01:05:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash 2001921525, now seen corresponding path program 1 times [2021-04-15 01:05:14,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-04-15 01:05:14,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731042009] [2021-04-15 01:05:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-04-15 01:05:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 01:05:14,077 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 01:05:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-04-15 01:05:14,114 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-04-15 01:05:14,159 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-04-15 01:05:14,160 INFO L652 BasicCegarLoop]: Counterexample might be feasible [2021-04-15 01:05:14,161 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-04-15 01:05:14,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 01:05:14 BasicIcfg [2021-04-15 01:05:14,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-04-15 01:05:14,300 INFO L168 Benchmark]: Toolchain (without parser) took 14833.30 ms. Allocated memory was 255.9 MB in the beginning and 3.2 GB in the end (delta: 2.9 GB). Free memory was 234.0 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,304 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. [2021-04-15 01:05:14,304 INFO L168 Benchmark]: CACSL2BoogieTranslator took 504.05 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 234.0 MB in the beginning and 330.0 MB in the end (delta: -96.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,304 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.13 ms. Allocated memory is still 371.2 MB. Free memory was 330.0 MB in the beginning and 327.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,305 INFO L168 Benchmark]: Boogie Preprocessor took 30.18 ms. Allocated memory is still 371.2 MB. Free memory was 327.1 MB in the beginning and 325.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,305 INFO L168 Benchmark]: RCFGBuilder took 1676.80 ms. Allocated memory is still 371.2 MB. Free memory was 325.0 MB in the beginning and 345.4 MB in the end (delta: -20.3 MB). Peak memory consumption was 69.7 MB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,305 INFO L168 Benchmark]: TraceAbstraction took 12563.46 ms. Allocated memory was 371.2 MB in the beginning and 3.2 GB in the end (delta: 2.8 GB). Free memory was 345.4 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. [2021-04-15 01:05:14,307 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 255.9 MB. Free memory is still 237.6 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 504.05 ms. Allocated memory was 255.9 MB in the beginning and 371.2 MB in the end (delta: 115.3 MB). Free memory was 234.0 MB in the beginning and 330.0 MB in the end (delta: -96.1 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 49.13 ms. Allocated memory is still 371.2 MB. Free memory was 330.0 MB in the beginning and 327.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 30.18 ms. Allocated memory is still 371.2 MB. Free memory was 327.1 MB in the beginning and 325.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 1676.80 ms. Allocated memory is still 371.2 MB. Free memory was 325.0 MB in the beginning and 345.4 MB in the end (delta: -20.3 MB). Peak memory consumption was 69.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 12563.46 ms. Allocated memory was 371.2 MB in the beginning and 3.2 GB in the end (delta: 2.8 GB). Free memory was 345.4 MB in the beginning and 2.1 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L710] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L711] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L713] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L715] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L716] 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] [L717] 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] [L718] 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] [L719] 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] [L720] 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] [L721] 0 _Bool y$r_buff0_thd3; 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_buff0_thd3=0] [L722] 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_buff0_thd3=0, y$r_buff1_thd0=0] [L723] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L724] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L725] 0 _Bool y$r_buff1_thd3; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L726] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L727] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L728] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L729] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L730] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L731] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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] [L733] 0 int z = 0; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L734] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L735] 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L811] 0 pthread_t t2498; 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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L812] FCALL, FORK 0 pthread_create(&t2498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2499; 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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t2499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2500; VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t2500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L789] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=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, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 94 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12302.4ms, OverallIterations: 19, TraceHistogramMax: 1, EmptinessCheckTime: 303.8ms, AutomataDifference: 4899.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 825.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2290 SDtfs, 3363 SDslu, 9237 SDs, 0 SdLazy, 1389 SolverSat, 244 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1366.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 264 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 3060.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=13392occurred in iteration=0, InterpolantAutomatonStates: 206, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 2732.8ms AutomataMinimizationTime, 18 MinimizatonAttempts, 4024 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 77.0ms SsaConstructionTime, 655.9ms SatisfiabilityAnalysisTime, 2407.3ms InterpolantComputationTime, 1191 NumberOfCodeBlocks, 1191 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1102 ConstructedInterpolants, 0 QuantifiedInterpolants, 6099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...