/usr/bin/java -Xmx8000000000 -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/safe029_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 16:51:38,885 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:51:38,887 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:51:38,921 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:51:38,921 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:51:38,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:51:38,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:51:38,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:51:38,925 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:51:38,925 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:51:38,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:51:38,926 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:51:38,927 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:51:38,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:51:38,928 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:51:38,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:51:38,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:51:38,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:51:38,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:51:38,952 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:51:38,953 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:51:38,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:51:38,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:51:38,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:51:38,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:51:38,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:51:38,957 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:51:38,957 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:51:38,958 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:51:38,958 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:51:38,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:51:38,959 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:51:38,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:51:38,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:51:38,960 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:51:38,960 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:51:38,961 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:51:38,961 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:51:38,961 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:51:38,961 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:51:38,962 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:51:38,977 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-07-09 16:51:39,008 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:51:39,008 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:51:39,008 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:51:39,008 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:51:39,009 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:51:39,009 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:51:39,009 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:51:39,009 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:51:39,009 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:51:39,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:51:39,011 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:51:39,011 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:51:39,011 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:51:39,011 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:51:39,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:51:39,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:51:39,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:51:39,011 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:51:39,011 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:51:39,012 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:51:39,012 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:51:39,012 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:51:39,012 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-07-09 16:51:39,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:51:39,328 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:51:39,329 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:51:39,330 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:51:39,331 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:51:39,331 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-07-09 16:51:39,379 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f161c44fd/000d485f6e864027a333d7f334bc3dbb/FLAG265c66429 [2021-07-09 16:51:39,888 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:51:39,888 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i [2021-07-09 16:51:39,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f161c44fd/000d485f6e864027a333d7f334bc3dbb/FLAG265c66429 [2021-07-09 16:51:40,351 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f161c44fd/000d485f6e864027a333d7f334bc3dbb [2021-07-09 16:51:40,353 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:51:40,354 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:51:40,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:51:40,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:51:40,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:51:40,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36a941e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40, skipping insertion in model container [2021-07-09 16:51:40,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:51:40,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:51:40,513 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i[950,963] [2021-07-09 16:51:40,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:51:40,621 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:51:40,629 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_rmo.oepc.i[950,963] [2021-07-09 16:51:40,665 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:51:40,697 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:51:40,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40 WrapperNode [2021-07-09 16:51:40,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:51:40,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:51:40,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:51:40,698 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:51:40,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,715 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,745 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:51:40,746 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:51:40,746 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:51:40,746 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:51:40,756 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,778 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (1/1) ... [2021-07-09 16:51:40,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:51:40,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:51:40,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:51:40,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:51:40,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (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-07-09 16:51:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:51:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:51:40,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:51:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:51:40,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 16:51:40,944 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 16:51:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 16:51:40,945 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 16:51:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:51:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:51:40,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:51:40,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:51:40,946 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 16:51:42,287 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:51:42,288 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 16:51:42,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:51:42 BoogieIcfgContainer [2021-07-09 16:51:42,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:51:42,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:51:42,293 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:51:42,295 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:51:42,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:51:40" (1/3) ... [2021-07-09 16:51:42,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a730e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:51:42, skipping insertion in model container [2021-07-09 16:51:42,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:51:40" (2/3) ... [2021-07-09 16:51:42,296 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10a730e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:51:42, skipping insertion in model container [2021-07-09 16:51:42,296 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:51:42" (3/3) ... [2021-07-09 16:51:42,297 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_rmo.oepc.i [2021-07-09 16:51:42,302 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:51:42,302 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:51:42,302 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 16:51:42,303 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:51:42,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,324 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,324 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,325 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,326 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,327 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,328 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,329 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,329 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,330 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,330 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,331 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,334 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,334 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,337 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:51:42,338 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 16:51:42,357 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-09 16:51:42,368 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:51:42,368 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:51:42,368 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:51:42,369 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:51:42,369 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:51:42,369 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:51:42,369 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:51:42,369 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:51:42,377 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 85 transitions, 180 flow [2021-07-09 16:51:42,427 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1250 states, 1248 states have (on average 2.6746794871794872) internal successors, (3338), 1249 states have internal predecessors, (3338), 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-07-09 16:51:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand has 1250 states, 1248 states have (on average 2.6746794871794872) internal successors, (3338), 1249 states have internal predecessors, (3338), 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-07-09 16:51:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-07-09 16:51:42,452 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:42,453 INFO L508 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] [2021-07-09 16:51:42,453 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:42,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash 85745205, now seen corresponding path program 1 times [2021-07-09 16:51:42,462 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:42,463 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818225002] [2021-07-09 16:51:42,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:42,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:42,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:42,789 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:42,789 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818225002] [2021-07-09 16:51:42,790 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818225002] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:42,790 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:42,790 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:42,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352359276] [2021-07-09 16:51:42,796 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:42,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:42,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:42,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:42,809 INFO L87 Difference]: Start difference. First operand has 1250 states, 1248 states have (on average 2.6746794871794872) internal successors, (3338), 1249 states have internal predecessors, (3338), 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 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-07-09 16:51:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:42,932 INFO L93 Difference]: Finished difference Result 1490 states and 3854 transitions. [2021-07-09 16:51:42,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:42,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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 56 [2021-07-09 16:51:42,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:42,952 INFO L225 Difference]: With dead ends: 1490 [2021-07-09 16:51:42,953 INFO L226 Difference]: Without dead ends: 1130 [2021-07-09 16:51:42,954 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 76.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:42,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2021-07-09 16:51:43,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2021-07-09 16:51:43,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 1128 states have (on average 2.5913120567375887) internal successors, (2923), 1129 states have internal predecessors, (2923), 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-07-09 16:51:43,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 2923 transitions. [2021-07-09 16:51:43,036 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 2923 transitions. Word has length 56 [2021-07-09 16:51:43,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:43,037 INFO L482 AbstractCegarLoop]: Abstraction has 1130 states and 2923 transitions. [2021-07-09 16:51:43,037 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 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-07-09 16:51:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 2923 transitions. [2021-07-09 16:51:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-07-09 16:51:43,044 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:43,044 INFO L508 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] [2021-07-09 16:51:43,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:51:43,044 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash 584754742, now seen corresponding path program 1 times [2021-07-09 16:51:43,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:43,047 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948318815] [2021-07-09 16:51:43,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:43,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:43,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:43,330 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:43,330 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948318815] [2021-07-09 16:51:43,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948318815] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:43,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:43,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:51:43,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006746374] [2021-07-09 16:51:43,332 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:51:43,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:43,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:51:43,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:43,333 INFO L87 Difference]: Start difference. First operand 1130 states and 2923 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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-07-09 16:51:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:43,595 INFO L93 Difference]: Finished difference Result 1343 states and 3437 transitions. [2021-07-09 16:51:43,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-07-09 16:51:43,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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 58 [2021-07-09 16:51:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:43,602 INFO L225 Difference]: With dead ends: 1343 [2021-07-09 16:51:43,602 INFO L226 Difference]: Without dead ends: 1127 [2021-07-09 16:51:43,604 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 241.9ms TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:51:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2021-07-09 16:51:43,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1118. [2021-07-09 16:51:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1116 states have (on average 2.5815412186379927) internal successors, (2881), 1117 states have internal predecessors, (2881), 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-07-09 16:51:43,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 2881 transitions. [2021-07-09 16:51:43,628 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 2881 transitions. Word has length 58 [2021-07-09 16:51:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:43,628 INFO L482 AbstractCegarLoop]: Abstraction has 1118 states and 2881 transitions. [2021-07-09 16:51:43,628 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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-07-09 16:51:43,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 2881 transitions. [2021-07-09 16:51:43,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-09 16:51:43,631 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:43,632 INFO L508 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-07-09 16:51:43,632 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:51:43,632 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:43,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:43,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1839003162, now seen corresponding path program 1 times [2021-07-09 16:51:43,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:43,633 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529004624] [2021-07-09 16:51:43,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:43,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:43,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:43,738 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:43,738 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529004624] [2021-07-09 16:51:43,738 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529004624] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:43,738 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:43,738 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:43,738 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224721601] [2021-07-09 16:51:43,738 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:43,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:43,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:43,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:43,739 INFO L87 Difference]: Start difference. First operand 1118 states and 2881 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-07-09 16:51:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:43,820 INFO L93 Difference]: Finished difference Result 1788 states and 4552 transitions. [2021-07-09 16:51:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:43,820 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-07-09 16:51:43,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:43,824 INFO L225 Difference]: With dead ends: 1788 [2021-07-09 16:51:43,825 INFO L226 Difference]: Without dead ends: 1238 [2021-07-09 16:51:43,825 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 68.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2021-07-09 16:51:43,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 1058. [2021-07-09 16:51:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 1056 states have (on average 2.5179924242424243) internal successors, (2659), 1057 states have internal predecessors, (2659), 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-07-09 16:51:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2659 transitions. [2021-07-09 16:51:43,863 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2659 transitions. Word has length 59 [2021-07-09 16:51:43,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:43,863 INFO L482 AbstractCegarLoop]: Abstraction has 1058 states and 2659 transitions. [2021-07-09 16:51:43,863 INFO L483 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-07-09 16:51:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2659 transitions. [2021-07-09 16:51:43,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-07-09 16:51:43,865 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:43,865 INFO L508 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-07-09 16:51:43,865 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:51:43,865 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:43,865 INFO L82 PathProgramCache]: Analyzing trace with hash -776130942, now seen corresponding path program 1 times [2021-07-09 16:51:43,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:43,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384670164] [2021-07-09 16:51:43,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:44,035 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:44,037 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384670164] [2021-07-09 16:51:44,038 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384670164] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:44,038 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:44,038 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:51:44,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157691576] [2021-07-09 16:51:44,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:51:44,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:44,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:51:44,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:51:44,043 INFO L87 Difference]: Start difference. First operand 1058 states and 2659 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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-07-09 16:51:44,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:44,246 INFO L93 Difference]: Finished difference Result 1043 states and 2580 transitions. [2021-07-09 16:51:44,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:51:44,246 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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-07-09 16:51:44,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:44,249 INFO L225 Difference]: With dead ends: 1043 [2021-07-09 16:51:44,249 INFO L226 Difference]: Without dead ends: 883 [2021-07-09 16:51:44,250 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 162.2ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:51:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2021-07-09 16:51:44,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 883. [2021-07-09 16:51:44,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 882 states have (on average 2.473922902494331) internal successors, (2182), 882 states have internal predecessors, (2182), 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-07-09 16:51:44,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 2182 transitions. [2021-07-09 16:51:44,264 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 2182 transitions. Word has length 59 [2021-07-09 16:51:44,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:44,264 INFO L482 AbstractCegarLoop]: Abstraction has 883 states and 2182 transitions. [2021-07-09 16:51:44,264 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 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-07-09 16:51:44,265 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 2182 transitions. [2021-07-09 16:51:44,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-07-09 16:51:44,266 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:44,267 INFO L508 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-07-09 16:51:44,267 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:51:44,267 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:44,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:44,267 INFO L82 PathProgramCache]: Analyzing trace with hash -2001036492, now seen corresponding path program 1 times [2021-07-09 16:51:44,268 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:44,268 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947455167] [2021-07-09 16:51:44,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:44,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:44,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:44,387 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:44,387 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947455167] [2021-07-09 16:51:44,388 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947455167] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:44,388 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:44,388 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:51:44,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261785826] [2021-07-09 16:51:44,388 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:51:44,388 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:44,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:51:44,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:51:44,389 INFO L87 Difference]: Start difference. First operand 883 states and 2182 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-07-09 16:51:44,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:44,575 INFO L93 Difference]: Finished difference Result 1015 states and 2496 transitions. [2021-07-09 16:51:44,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:51:44,575 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-07-09 16:51:44,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:44,578 INFO L225 Difference]: With dead ends: 1015 [2021-07-09 16:51:44,578 INFO L226 Difference]: Without dead ends: 871 [2021-07-09 16:51:44,578 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 121.6ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:51:44,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2021-07-09 16:51:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 871. [2021-07-09 16:51:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 2.466666666666667) internal successors, (2146), 870 states have internal predecessors, (2146), 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-07-09 16:51:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 2146 transitions. [2021-07-09 16:51:44,593 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 2146 transitions. Word has length 60 [2021-07-09 16:51:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:44,594 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 2146 transitions. [2021-07-09 16:51:44,594 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 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-07-09 16:51:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 2146 transitions. [2021-07-09 16:51:44,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-09 16:51:44,595 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:44,595 INFO L508 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-07-09 16:51:44,595 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:51:44,595 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:44,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash 668719428, now seen corresponding path program 1 times [2021-07-09 16:51:44,596 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:44,596 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124181650] [2021-07-09 16:51:44,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:44,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:44,735 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:44,735 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124181650] [2021-07-09 16:51:44,735 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124181650] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:44,736 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:44,736 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:51:44,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976225826] [2021-07-09 16:51:44,736 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:51:44,736 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:44,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:51:44,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:51:44,739 INFO L87 Difference]: Start difference. First operand 871 states and 2146 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-07-09 16:51:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:44,970 INFO L93 Difference]: Finished difference Result 1076 states and 2651 transitions. [2021-07-09 16:51:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:51:44,971 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-07-09 16:51:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:44,975 INFO L225 Difference]: With dead ends: 1076 [2021-07-09 16:51:44,975 INFO L226 Difference]: Without dead ends: 940 [2021-07-09 16:51:44,975 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 149.9ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:51:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2021-07-09 16:51:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 916. [2021-07-09 16:51:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 915 states have (on average 2.466666666666667) internal successors, (2257), 915 states have internal predecessors, (2257), 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-07-09 16:51:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 2257 transitions. [2021-07-09 16:51:44,991 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 2257 transitions. Word has length 61 [2021-07-09 16:51:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:44,992 INFO L482 AbstractCegarLoop]: Abstraction has 916 states and 2257 transitions. [2021-07-09 16:51:44,992 INFO L483 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-07-09 16:51:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 2257 transitions. [2021-07-09 16:51:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-09 16:51:44,993 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:44,993 INFO L508 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-07-09 16:51:44,993 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:51:44,993 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1966144196, now seen corresponding path program 2 times [2021-07-09 16:51:44,994 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:44,994 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733568030] [2021-07-09 16:51:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:45,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:45,152 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:45,153 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733568030] [2021-07-09 16:51:45,153 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733568030] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:45,153 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:45,153 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:51:45,153 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535161804] [2021-07-09 16:51:45,154 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:51:45,155 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:45,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:51:45,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:51:45,157 INFO L87 Difference]: Start difference. First operand 916 states and 2257 transitions. Second operand has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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-07-09 16:51:45,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:45,424 INFO L93 Difference]: Finished difference Result 1069 states and 2621 transitions. [2021-07-09 16:51:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:51:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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-07-09 16:51:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:45,428 INFO L225 Difference]: With dead ends: 1069 [2021-07-09 16:51:45,428 INFO L226 Difference]: Without dead ends: 949 [2021-07-09 16:51:45,430 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 191.7ms TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:51:45,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2021-07-09 16:51:45,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 910. [2021-07-09 16:51:45,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 909 states have (on average 2.4697469746974696) internal successors, (2245), 909 states have internal predecessors, (2245), 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-07-09 16:51:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 2245 transitions. [2021-07-09 16:51:45,456 INFO L78 Accepts]: Start accepts. Automaton has 910 states and 2245 transitions. Word has length 61 [2021-07-09 16:51:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:45,456 INFO L482 AbstractCegarLoop]: Abstraction has 910 states and 2245 transitions. [2021-07-09 16:51:45,456 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 6.777777777777778) internal successors, (61), 9 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-07-09 16:51:45,456 INFO L276 IsEmpty]: Start isEmpty. Operand 910 states and 2245 transitions. [2021-07-09 16:51:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-07-09 16:51:45,458 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:45,458 INFO L508 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-07-09 16:51:45,458 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:51:45,458 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:45,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash 926193800, now seen corresponding path program 3 times [2021-07-09 16:51:45,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:45,461 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353910877] [2021-07-09 16:51:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:45,614 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:45,614 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353910877] [2021-07-09 16:51:45,614 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353910877] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:45,614 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:45,614 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:51:45,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916075223] [2021-07-09 16:51:45,615 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:51:45,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:45,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:51:45,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:51:45,615 INFO L87 Difference]: Start difference. First operand 910 states and 2245 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-07-09 16:51:45,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:45,783 INFO L93 Difference]: Finished difference Result 1042 states and 2559 transitions. [2021-07-09 16:51:45,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:51:45,783 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-07-09 16:51:45,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:45,786 INFO L225 Difference]: With dead ends: 1042 [2021-07-09 16:51:45,786 INFO L226 Difference]: Without dead ends: 922 [2021-07-09 16:51:45,786 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 138.7ms TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:51:45,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2021-07-09 16:51:45,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 895. [2021-07-09 16:51:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 2.466442953020134) internal successors, (2205), 894 states have internal predecessors, (2205), 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-07-09 16:51:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2205 transitions. [2021-07-09 16:51:45,800 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2205 transitions. Word has length 61 [2021-07-09 16:51:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:45,800 INFO L482 AbstractCegarLoop]: Abstraction has 895 states and 2205 transitions. [2021-07-09 16:51:45,801 INFO L483 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-07-09 16:51:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2205 transitions. [2021-07-09 16:51:45,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-09 16:51:45,803 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:45,804 INFO L508 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-07-09 16:51:45,804 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:51:45,804 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:45,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:45,804 INFO L82 PathProgramCache]: Analyzing trace with hash -392941005, now seen corresponding path program 1 times [2021-07-09 16:51:45,804 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:45,804 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875623842] [2021-07-09 16:51:45,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:45,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:45,956 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:45,956 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875623842] [2021-07-09 16:51:45,957 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875623842] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:45,957 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:45,958 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:51:45,958 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171801345] [2021-07-09 16:51:45,958 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:51:45,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:45,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:51:45,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:51:45,959 INFO L87 Difference]: Start difference. First operand 895 states and 2205 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-07-09 16:51:46,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:46,542 INFO L93 Difference]: Finished difference Result 1140 states and 2786 transitions. [2021-07-09 16:51:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-07-09 16:51:46,542 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-07-09 16:51:46,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:46,546 INFO L225 Difference]: With dead ends: 1140 [2021-07-09 16:51:46,546 INFO L226 Difference]: Without dead ends: 928 [2021-07-09 16:51:46,546 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 396.1ms TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-07-09 16:51:46,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2021-07-09 16:51:46,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 898. [2021-07-09 16:51:46,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 897 states have (on average 2.450390189520624) internal successors, (2198), 897 states have internal predecessors, (2198), 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-07-09 16:51:46,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 2198 transitions. [2021-07-09 16:51:46,559 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 2198 transitions. Word has length 62 [2021-07-09 16:51:46,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:46,560 INFO L482 AbstractCegarLoop]: Abstraction has 898 states and 2198 transitions. [2021-07-09 16:51:46,560 INFO L483 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-07-09 16:51:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 2198 transitions. [2021-07-09 16:51:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-09 16:51:46,561 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:46,561 INFO L508 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-07-09 16:51:46,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:51:46,561 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:46,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:46,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1321215699, now seen corresponding path program 1 times [2021-07-09 16:51:46,562 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:46,562 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663788588] [2021-07-09 16:51:46,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:46,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:46,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663788588] [2021-07-09 16:51:46,712 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663788588] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:46,712 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:46,712 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:51:46,712 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425953567] [2021-07-09 16:51:46,712 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:51:46,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:46,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:51:46,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:51:46,713 INFO L87 Difference]: Start difference. First operand 898 states and 2198 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:46,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:46,904 INFO L93 Difference]: Finished difference Result 1367 states and 3291 transitions. [2021-07-09 16:51:46,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:51:46,904 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:46,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:46,908 INFO L225 Difference]: With dead ends: 1367 [2021-07-09 16:51:46,908 INFO L226 Difference]: Without dead ends: 973 [2021-07-09 16:51:46,908 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 182.6ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:51:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2021-07-09 16:51:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 853. [2021-07-09 16:51:46,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 853 states, 852 states have (on average 2.381455399061033) internal successors, (2029), 852 states have internal predecessors, (2029), 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-07-09 16:51:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 2029 transitions. [2021-07-09 16:51:46,922 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 2029 transitions. Word has length 62 [2021-07-09 16:51:46,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:46,922 INFO L482 AbstractCegarLoop]: Abstraction has 853 states and 2029 transitions. [2021-07-09 16:51:46,922 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:46,922 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 2029 transitions. [2021-07-09 16:51:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-09 16:51:46,923 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:46,923 INFO L508 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-07-09 16:51:46,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:51:46,924 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:46,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:46,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1408289453, now seen corresponding path program 2 times [2021-07-09 16:51:46,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:46,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525309913] [2021-07-09 16:51:46,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:46,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:47,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:47,059 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:47,059 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525309913] [2021-07-09 16:51:47,059 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525309913] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:47,059 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:47,060 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:51:47,060 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359272588] [2021-07-09 16:51:47,061 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:51:47,061 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:47,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:51:47,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:51:47,062 INFO L87 Difference]: Start difference. First operand 853 states and 2029 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:47,252 INFO L93 Difference]: Finished difference Result 985 states and 2315 transitions. [2021-07-09 16:51:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:51:47,252 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:47,255 INFO L225 Difference]: With dead ends: 985 [2021-07-09 16:51:47,255 INFO L226 Difference]: Without dead ends: 844 [2021-07-09 16:51:47,255 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 166.0ms TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:51:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2021-07-09 16:51:47,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 844. [2021-07-09 16:51:47,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 844 states, 843 states have (on average 2.376037959667853) internal successors, (2003), 843 states have internal predecessors, (2003), 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-07-09 16:51:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 2003 transitions. [2021-07-09 16:51:47,267 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 2003 transitions. Word has length 62 [2021-07-09 16:51:47,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:47,267 INFO L482 AbstractCegarLoop]: Abstraction has 844 states and 2003 transitions. [2021-07-09 16:51:47,267 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:47,267 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 2003 transitions. [2021-07-09 16:51:47,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-09 16:51:47,269 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:47,269 INFO L508 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-07-09 16:51:47,269 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:51:47,269 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:47,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:47,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1215386497, now seen corresponding path program 3 times [2021-07-09 16:51:47,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:47,269 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832359898] [2021-07-09 16:51:47,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:47,394 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:47,394 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832359898] [2021-07-09 16:51:47,395 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832359898] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:47,395 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:47,395 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:51:47,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330709348] [2021-07-09 16:51:47,395 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:51:47,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:51:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:51:47,395 INFO L87 Difference]: Start difference. First operand 844 states and 2003 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:47,618 INFO L93 Difference]: Finished difference Result 977 states and 2312 transitions. [2021-07-09 16:51:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:51:47,619 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:47,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:47,621 INFO L225 Difference]: With dead ends: 977 [2021-07-09 16:51:47,621 INFO L226 Difference]: Without dead ends: 833 [2021-07-09 16:51:47,622 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 200.5ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:51:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 833 states. [2021-07-09 16:51:47,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 833 to 808. [2021-07-09 16:51:47,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 808 states, 807 states have (on average 2.36183395291202) internal successors, (1906), 807 states have internal predecessors, (1906), 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-07-09 16:51:47,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 1906 transitions. [2021-07-09 16:51:47,634 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 1906 transitions. Word has length 62 [2021-07-09 16:51:47,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:47,634 INFO L482 AbstractCegarLoop]: Abstraction has 808 states and 1906 transitions. [2021-07-09 16:51:47,634 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:47,634 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 1906 transitions. [2021-07-09 16:51:47,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-09 16:51:47,635 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:47,635 INFO L508 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-07-09 16:51:47,635 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:51:47,635 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:47,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:47,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1510115127, now seen corresponding path program 4 times [2021-07-09 16:51:47,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:47,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321408232] [2021-07-09 16:51:47,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:47,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:47,816 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:47,816 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321408232] [2021-07-09 16:51:47,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321408232] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:47,817 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:47,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 16:51:47,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126030386] [2021-07-09 16:51:47,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 16:51:47,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:47,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 16:51:47,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:47,818 INFO L87 Difference]: Start difference. First operand 808 states and 1906 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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-07-09 16:51:47,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:47,993 INFO L93 Difference]: Finished difference Result 908 states and 2137 transitions. [2021-07-09 16:51:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:51:47,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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-07-09 16:51:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:47,998 INFO L225 Difference]: With dead ends: 908 [2021-07-09 16:51:47,998 INFO L226 Difference]: Without dead ends: 736 [2021-07-09 16:51:47,998 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 161.0ms TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:51:47,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2021-07-09 16:51:48,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 736. [2021-07-09 16:51:48,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 735 states have (on average 2.3537414965986394) internal successors, (1730), 735 states have internal predecessors, (1730), 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-07-09 16:51:48,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1730 transitions. [2021-07-09 16:51:48,008 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1730 transitions. Word has length 62 [2021-07-09 16:51:48,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:48,008 INFO L482 AbstractCegarLoop]: Abstraction has 736 states and 1730 transitions. [2021-07-09 16:51:48,008 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 11 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-07-09 16:51:48,008 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1730 transitions. [2021-07-09 16:51:48,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-09 16:51:48,010 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:48,010 INFO L508 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-07-09 16:51:48,010 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 16:51:48,010 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:48,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:48,010 INFO L82 PathProgramCache]: Analyzing trace with hash -674304891, now seen corresponding path program 5 times [2021-07-09 16:51:48,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:48,010 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969334144] [2021-07-09 16:51:48,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:48,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:48,183 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:48,183 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969334144] [2021-07-09 16:51:48,183 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969334144] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:48,183 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:48,183 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:51:48,184 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450577307] [2021-07-09 16:51:48,184 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:51:48,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:48,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:51:48,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:51:48,184 INFO L87 Difference]: Start difference. First operand 736 states and 1730 transitions. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:48,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:48,546 INFO L93 Difference]: Finished difference Result 809 states and 1894 transitions. [2021-07-09 16:51:48,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:51:48,547 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:48,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:48,549 INFO L225 Difference]: With dead ends: 809 [2021-07-09 16:51:48,549 INFO L226 Difference]: Without dead ends: 674 [2021-07-09 16:51:48,549 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 323.9ms TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:51:48,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2021-07-09 16:51:48,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 649. [2021-07-09 16:51:48,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 2.3425925925925926) internal successors, (1518), 648 states have internal predecessors, (1518), 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-07-09 16:51:48,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 1518 transitions. [2021-07-09 16:51:48,557 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 1518 transitions. Word has length 62 [2021-07-09 16:51:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:48,558 INFO L482 AbstractCegarLoop]: Abstraction has 649 states and 1518 transitions. [2021-07-09 16:51:48,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 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-07-09 16:51:48,558 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 1518 transitions. [2021-07-09 16:51:48,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-07-09 16:51:48,559 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:48,559 INFO L508 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-07-09 16:51:48,559 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 16:51:48,559 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:48,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:48,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1420128151, now seen corresponding path program 2 times [2021-07-09 16:51:48,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:48,559 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534095394] [2021-07-09 16:51:48,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:48,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:48,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:48,606 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:48,606 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534095394] [2021-07-09 16:51:48,606 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534095394] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:48,606 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:48,606 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:51:48,606 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789899965] [2021-07-09 16:51:48,607 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:51:48,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:48,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:51:48,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:51:48,607 INFO L87 Difference]: Start difference. First operand 649 states and 1518 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-07-09 16:51:48,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:48,675 INFO L93 Difference]: Finished difference Result 719 states and 1642 transitions. [2021-07-09 16:51:48,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:51:48,676 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-07-09 16:51:48,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:48,677 INFO L225 Difference]: With dead ends: 719 [2021-07-09 16:51:48,677 INFO L226 Difference]: Without dead ends: 535 [2021-07-09 16:51:48,678 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 61.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:51:48,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2021-07-09 16:51:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 535. [2021-07-09 16:51:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 534 states have (on average 2.2659176029962547) internal successors, (1210), 534 states have internal predecessors, (1210), 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-07-09 16:51:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1210 transitions. [2021-07-09 16:51:48,685 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1210 transitions. Word has length 62 [2021-07-09 16:51:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:48,685 INFO L482 AbstractCegarLoop]: Abstraction has 535 states and 1210 transitions. [2021-07-09 16:51:48,685 INFO L483 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-07-09 16:51:48,685 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1210 transitions. [2021-07-09 16:51:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-07-09 16:51:48,686 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:48,686 INFO L508 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-07-09 16:51:48,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-09 16:51:48,686 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:48,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1844320774, now seen corresponding path program 1 times [2021-07-09 16:51:48,687 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:48,687 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704172349] [2021-07-09 16:51:48,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:51:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:51:48,742 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:51:48,742 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704172349] [2021-07-09 16:51:48,742 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704172349] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:51:48,742 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:51:48,742 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:51:48,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156331391] [2021-07-09 16:51:48,742 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:51:48,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:51:48,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:51:48,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:51:48,743 INFO L87 Difference]: Start difference. First operand 535 states and 1210 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-07-09 16:51:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:51:48,821 INFO L93 Difference]: Finished difference Result 457 states and 987 transitions. [2021-07-09 16:51:48,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:51:48,822 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-07-09 16:51:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:51:48,822 INFO L225 Difference]: With dead ends: 457 [2021-07-09 16:51:48,822 INFO L226 Difference]: Without dead ends: 273 [2021-07-09 16:51:48,823 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 72.7ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:51:48,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-07-09 16:51:48,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2021-07-09 16:51:48,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 272 states have (on average 2.0588235294117645) internal successors, (560), 272 states have internal predecessors, (560), 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-07-09 16:51:48,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 560 transitions. [2021-07-09 16:51:48,844 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 560 transitions. Word has length 63 [2021-07-09 16:51:48,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:51:48,845 INFO L482 AbstractCegarLoop]: Abstraction has 273 states and 560 transitions. [2021-07-09 16:51:48,845 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 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-07-09 16:51:48,845 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 560 transitions. [2021-07-09 16:51:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-09 16:51:48,846 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:51:48,846 INFO L508 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-07-09 16:51:48,846 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-09 16:51:48,846 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:51:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:51:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1860895717, now seen corresponding path program 1 times [2021-07-09 16:51:48,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:51:48,846 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035864331] [2021-07-09 16:51:48,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:51:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:51:48,869 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:51:48,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:51:48,897 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:51:48,930 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 16:51:48,930 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 16:51:48,930 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-09 16:51:48,931 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-09 16:51:48,932 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:51:48,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:51:48 BasicIcfg [2021-07-09 16:51:48,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:51:48,984 INFO L168 Benchmark]: Toolchain (without parser) took 8629.21 ms. Allocated memory was 187.7 MB in the beginning and 319.8 MB in the end (delta: 132.1 MB). Free memory was 149.9 MB in the beginning and 248.3 MB in the end (delta: -98.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:48,984 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 187.7 MB. Free memory is still 168.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:51:48,984 INFO L168 Benchmark]: CACSL2BoogieTranslator took 342.11 ms. Allocated memory is still 187.7 MB. Free memory was 149.7 MB in the beginning and 158.2 MB in the end (delta: -8.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:48,984 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.30 ms. Allocated memory is still 187.7 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:48,984 INFO L168 Benchmark]: Boogie Preprocessor took 34.88 ms. Allocated memory is still 187.7 MB. Free memory was 155.0 MB in the beginning and 152.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:48,984 INFO L168 Benchmark]: RCFGBuilder took 1510.07 ms. Allocated memory was 187.7 MB in the beginning and 233.8 MB in the end (delta: 46.1 MB). Free memory was 152.9 MB in the beginning and 206.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 98.4 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:48,984 INFO L168 Benchmark]: TraceAbstraction took 6690.36 ms. Allocated memory was 233.8 MB in the beginning and 319.8 MB in the end (delta: 86.0 MB). Free memory was 205.6 MB in the beginning and 248.3 MB in the end (delta: -42.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 8.0 GB. [2021-07-09 16:51:48,984 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.11 ms. Allocated memory is still 187.7 MB. Free memory is still 168.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 342.11 ms. Allocated memory is still 187.7 MB. Free memory was 149.7 MB in the beginning and 158.2 MB in the end (delta: -8.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 47.30 ms. Allocated memory is still 187.7 MB. Free memory was 157.7 MB in the beginning and 155.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.88 ms. Allocated memory is still 187.7 MB. Free memory was 155.0 MB in the beginning and 152.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1510.07 ms. Allocated memory was 187.7 MB in the beginning and 233.8 MB in the end (delta: 46.1 MB). Free memory was 152.9 MB in the beginning and 206.1 MB in the end (delta: -53.2 MB). Peak memory consumption was 98.4 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6690.36 ms. Allocated memory was 233.8 MB in the beginning and 319.8 MB in the end (delta: 86.0 MB). Free memory was 205.6 MB in the beginning and 248.3 MB in the end (delta: -42.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 8.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: [L708] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L709] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L710] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L712] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L714] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L715] 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] [L716] 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] [L717] 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] [L718] 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] [L719] 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] [L720] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L721] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L722] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L723] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L724] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L725] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L726] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L727] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L728] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L730] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 pthread_t t2481; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] FCALL, FORK 0 pthread_create(&t2481, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] 0 pthread_t t2482; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] FCALL, FORK 0 pthread_create(&t2482, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L748] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 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) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] 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) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6563.9ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 52.8ms, AutomataDifference: 3498.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 58.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1681 SDtfs, 2513 SDslu, 7342 SDs, 0 SdLazy, 1492 SolverSat, 280 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1257.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 551 ImplicationChecksByTransitivity, 2715.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1250occurred in iteration=0, InterpolantAutomatonStates: 198, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 316.8ms AutomataMinimizationTime, 16 MinimizatonAttempts, 479 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 46.6ms SsaConstructionTime, 410.3ms SatisfiabilityAnalysisTime, 1926.7ms InterpolantComputationTime, 1038 NumberOfCodeBlocks, 1038 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 956 ConstructedInterpolants, 0 QuantifiedInterpolants, 5972 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...