/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-pthread/cs_sync.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 01:50:02,191 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 01:50:02,193 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 01:50:02,242 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 01:50:02,242 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 01:50:02,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 01:50:02,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 01:50:02,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 01:50:02,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 01:50:02,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 01:50:02,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 01:50:02,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 01:50:02,258 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 01:50:02,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 01:50:02,261 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 01:50:02,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 01:50:02,262 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 01:50:02,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 01:50:02,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 01:50:02,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 01:50:02,275 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 01:50:02,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 01:50:02,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 01:50:02,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 01:50:02,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 01:50:02,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 01:50:02,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 01:50:02,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 01:50:02,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 01:50:02,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 01:50:02,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 01:50:02,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 01:50:02,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 01:50:02,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 01:50:02,292 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 01:50:02,292 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 01:50:02,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 01:50:02,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 01:50:02,293 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 01:50:02,294 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 01:50:02,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 01:50:02,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-10 01:50:02,329 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 01:50:02,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 01:50:02,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 01:50:02,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 01:50:02,330 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 01:50:02,331 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 01:50:02,331 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 01:50:02,331 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 01:50:02,331 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 01:50:02,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 01:50:02,332 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 01:50:02,332 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 01:50:02,332 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 01:50:02,333 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 01:50:02,333 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 01:50:02,333 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 01:50:02,333 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 01:50:02,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 01:50:02,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 01:50:02,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 01:50:02,333 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 01:50:02,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:50:02,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 01:50:02,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 01:50:02,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 01:50:02,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 01:50:02,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 01:50:02,335 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 01:50:02,336 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 01:50:02,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 01:50:02,336 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 01:50:02,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 01:50:02,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 01:50:02,595 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 01:50:02,596 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 01:50:02,597 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 01:50:02,598 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-pthread/cs_sync.i [2022-01-10 01:50:02,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c50ed949/b70b9bc56ccf4f69b207206a79aea1a3/FLAG1167591e9 [2022-01-10 01:50:03,086 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 01:50:03,086 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_sync.i [2022-01-10 01:50:03,107 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c50ed949/b70b9bc56ccf4f69b207206a79aea1a3/FLAG1167591e9 [2022-01-10 01:50:03,122 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c50ed949/b70b9bc56ccf4f69b207206a79aea1a3 [2022-01-10 01:50:03,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 01:50:03,126 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 01:50:03,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 01:50:03,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 01:50:03,134 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 01:50:03,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d112856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03, skipping insertion in model container [2022-01-10 01:50:03,136 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,142 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 01:50:03,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 01:50:03,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_sync.i[34698,34711] [2022-01-10 01:50:03,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:50:03,635 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 01:50:03,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/seq-pthread/cs_sync.i[34698,34711] [2022-01-10 01:50:03,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 01:50:03,782 INFO L208 MainTranslator]: Completed translation [2022-01-10 01:50:03,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03 WrapperNode [2022-01-10 01:50:03,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 01:50:03,786 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 01:50:03,786 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 01:50:03,786 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 01:50:03,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,831 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,888 INFO L137 Inliner]: procedures = 245, calls = 244, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 544 [2022-01-10 01:50:03,889 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 01:50:03,889 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 01:50:03,889 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 01:50:03,889 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 01:50:03,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,909 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 01:50:03,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 01:50:03,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 01:50:03,952 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 01:50:03,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (1/1) ... [2022-01-10 01:50:03,963 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 01:50:03,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:03,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 01:50:04,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 01:50:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-10 01:50:04,070 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-10 01:50:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 01:50:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_signal [2022-01-10 01:50:04,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_signal [2022-01-10 01:50:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2022-01-10 01:50:04,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2022-01-10 01:50:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 01:50:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 01:50:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 01:50:04,071 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2022-01-10 01:50:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2022-01-10 01:50:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 01:50:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_init [2022-01-10 01:50:04,072 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_init [2022-01-10 01:50:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 01:50:04,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 01:50:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 01:50:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2022-01-10 01:50:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2022-01-10 01:50:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_cond_wait [2022-01-10 01:50:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_cond_wait [2022-01-10 01:50:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2022-01-10 01:50:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2022-01-10 01:50:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-01-10 01:50:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2022-01-10 01:50:04,073 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2022-01-10 01:50:04,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2022-01-10 01:50:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 01:50:04,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 01:50:04,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 01:50:04,272 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 01:50:04,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 01:50:04,518 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !(0 != ~__CS_ret~0 % 256); [2022-01-10 01:50:04,519 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 01:50:04,519 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##26: assume !(0 != ~__CS_ret~0 % 256); [2022-01-10 01:50:04,519 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 01:50:04,519 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L991: SUMMARY for call __CS_cs(); srcloc: null [2022-01-10 01:50:04,519 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume 0 != ~__CS_ret~0 % 256;main_thread_#res#1.base, main_thread_#res#1.offset := 0, 0;call ULTIMATE.dealloc(main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset);havoc main_thread_~#t1~0#1.base, main_thread_~#t1~0#1.offset;call ULTIMATE.dealloc(main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset);havoc main_thread_~#t2~0#1.base, main_thread_~#t2~0#1.offset; [2022-01-10 01:50:04,519 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint L991-1: assume !(0 != ~__CS_ret~0 % 256); [2022-01-10 01:50:06,769 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 01:50:06,777 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 01:50:06,777 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 01:50:06,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:50:06 BoogieIcfgContainer [2022-01-10 01:50:06,779 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 01:50:06,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 01:50:06,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 01:50:06,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 01:50:06,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 01:50:03" (1/3) ... [2022-01-10 01:50:06,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523a6634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:50:06, skipping insertion in model container [2022-01-10 01:50:06,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 01:50:03" (2/3) ... [2022-01-10 01:50:06,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523a6634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 01:50:06, skipping insertion in model container [2022-01-10 01:50:06,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 01:50:06" (3/3) ... [2022-01-10 01:50:06,801 INFO L111 eAbstractionObserver]: Analyzing ICFG cs_sync.i [2022-01-10 01:50:06,809 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 01:50:06,809 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 01:50:06,855 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 01:50:06,859 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 01:50:06,859 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 01:50:06,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-01-10 01:50:06,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-01-10 01:50:06,895 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:06,896 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:06,896 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:06,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:06,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1902090431, now seen corresponding path program 1 times [2022-01-10 01:50:06,905 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:06,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104495064] [2022-01-10 01:50:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:06,906 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-01-10 01:50:07,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-01-10 01:50:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 01:50:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-01-10 01:50:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-01-10 01:50:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-01-10 01:50:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-01-10 01:50:07,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-01-10 01:50:07,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-01-10 01:50:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:07,549 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104495064] [2022-01-10 01:50:07,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104495064] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:07,550 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:50:07,550 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:50:07,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734197189] [2022-01-10 01:50:07,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:07,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:50:07,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:07,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:50:07,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:50:07,591 INFO L87 Difference]: Start difference. First operand has 194 states, 127 states have (on average 1.4566929133858268) internal successors, (185), 128 states have internal predecessors, (185), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:07,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:07,717 INFO L93 Difference]: Finished difference Result 390 states and 641 transitions. [2022-01-10 01:50:07,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:50:07,726 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 72 [2022-01-10 01:50:07,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:07,736 INFO L225 Difference]: With dead ends: 390 [2022-01-10 01:50:07,737 INFO L226 Difference]: Without dead ends: 194 [2022-01-10 01:50:07,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:50:07,750 INFO L933 BasicCegarLoop]: 285 mSDtfsCounter, 4 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:07,751 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 568 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:07,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-01-10 01:50:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2022-01-10 01:50:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 125 states have (on average 1.4) internal successors, (175), 125 states have internal predecessors, (175), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-01-10 01:50:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2022-01-10 01:50:07,809 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 72 [2022-01-10 01:50:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:07,810 INFO L470 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2022-01-10 01:50:07,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2022-01-10 01:50:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-01-10 01:50:07,825 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:07,826 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:07,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 01:50:07,829 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:07,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:07,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1569921272, now seen corresponding path program 1 times [2022-01-10 01:50:07,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:07,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022552701] [2022-01-10 01:50:07,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:07,831 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-01-10 01:50:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:50:08,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-10 01:50:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-10 01:50:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:50:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 01:50:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:50:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-10 01:50:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:50:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:08,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:08,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022552701] [2022-01-10 01:50:08,127 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022552701] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:08,127 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 01:50:08,127 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 01:50:08,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073634059] [2022-01-10 01:50:08,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:08,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:50:08,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:08,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:50:08,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:50:08,130 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:08,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:08,180 INFO L93 Difference]: Finished difference Result 381 states and 570 transitions. [2022-01-10 01:50:08,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:50:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 75 [2022-01-10 01:50:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:08,188 INFO L225 Difference]: With dead ends: 381 [2022-01-10 01:50:08,188 INFO L226 Difference]: Without dead ends: 193 [2022-01-10 01:50:08,189 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 01:50:08,190 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:08,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 561 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-01-10 01:50:08,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2022-01-10 01:50:08,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 126 states have (on average 1.3968253968253967) internal successors, (176), 126 states have internal predecessors, (176), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-01-10 01:50:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 286 transitions. [2022-01-10 01:50:08,210 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 286 transitions. Word has length 75 [2022-01-10 01:50:08,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:08,210 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 286 transitions. [2022-01-10 01:50:08,210 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 286 transitions. [2022-01-10 01:50:08,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-01-10 01:50:08,212 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:08,213 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:08,213 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 01:50:08,213 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:08,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:08,213 INFO L85 PathProgramCache]: Analyzing trace with hash 217866074, now seen corresponding path program 1 times [2022-01-10 01:50:08,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:08,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814266127] [2022-01-10 01:50:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:08,214 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 01:50:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-10 01:50:08,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-10 01:50:08,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-01-10 01:50:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-01-10 01:50:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-01-10 01:50:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-01-10 01:50:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-01-10 01:50:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-01-10 01:50:08,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-01-10 01:50:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:08,463 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:08,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:08,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814266127] [2022-01-10 01:50:08,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814266127] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:08,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994521043] [2022-01-10 01:50:08,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:08,466 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:08,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:08,471 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:08,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 01:50:09,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:09,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 1763 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:50:09,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:09,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:09,509 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-01-10 01:50:09,510 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994521043] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:09,510 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:09,510 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2022-01-10 01:50:09,510 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648191010] [2022-01-10 01:50:09,510 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:09,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 01:50:09,511 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:09,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 01:50:09,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:50:09,512 INFO L87 Difference]: Start difference. First operand 192 states and 286 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-01-10 01:50:09,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:09,563 INFO L93 Difference]: Finished difference Result 385 states and 575 transitions. [2022-01-10 01:50:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:50:09,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 77 [2022-01-10 01:50:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:09,573 INFO L225 Difference]: With dead ends: 385 [2022-01-10 01:50:09,573 INFO L226 Difference]: Without dead ends: 196 [2022-01-10 01:50:09,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:50:09,575 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 3 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:09,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 1119 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2022-01-10 01:50:09,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-01-10 01:50:09,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 130 states have internal predecessors, (180), 55 states have call successors, (55), 10 states have call predecessors, (55), 10 states have return successors, (55), 55 states have call predecessors, (55), 55 states have call successors, (55) [2022-01-10 01:50:09,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 290 transitions. [2022-01-10 01:50:09,610 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 290 transitions. Word has length 77 [2022-01-10 01:50:09,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:09,611 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 290 transitions. [2022-01-10 01:50:09,611 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2022-01-10 01:50:09,611 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 290 transitions. [2022-01-10 01:50:09,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-01-10 01:50:09,615 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:09,615 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:09,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:09,818 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:09,818 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:09,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:09,819 INFO L85 PathProgramCache]: Analyzing trace with hash 971561630, now seen corresponding path program 2 times [2022-01-10 01:50:09,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:09,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744878332] [2022-01-10 01:50:09,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:09,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:09,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-10 01:50:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-10 01:50:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-01-10 01:50:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-01-10 01:50:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-01-10 01:50:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:50:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-01-10 01:50:10,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-01-10 01:50:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-01-10 01:50:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:10,077 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2022-01-10 01:50:10,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:10,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744878332] [2022-01-10 01:50:10,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744878332] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:10,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597076278] [2022-01-10 01:50:10,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:50:10,078 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:10,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:10,080 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:10,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 01:50:10,882 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 01:50:10,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:50:10,890 INFO L263 TraceCheckSpWp]: Trace formula consists of 1519 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 01:50:10,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-01-10 01:50:11,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:50:11,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597076278] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:11,112 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:50:11,112 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-01-10 01:50:11,112 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842625104] [2022-01-10 01:50:11,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:11,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:50:11,113 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:11,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:50:11,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 01:50:11,114 INFO L87 Difference]: Start difference. First operand 196 states and 290 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:11,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:11,152 INFO L93 Difference]: Finished difference Result 377 states and 570 transitions. [2022-01-10 01:50:11,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 01:50:11,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 81 [2022-01-10 01:50:11,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:11,157 INFO L225 Difference]: With dead ends: 377 [2022-01-10 01:50:11,157 INFO L226 Difference]: Without dead ends: 351 [2022-01-10 01:50:11,158 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-01-10 01:50:11,159 INFO L933 BasicCegarLoop]: 392 mSDtfsCounter, 230 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1057 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:11,159 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [230 Valid, 1057 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-01-10 01:50:11,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 350. [2022-01-10 01:50:11,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 230 states have internal predecessors, (325), 99 states have call successors, (99), 20 states have call predecessors, (99), 20 states have return successors, (107), 99 states have call predecessors, (107), 99 states have call successors, (107) [2022-01-10 01:50:11,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 531 transitions. [2022-01-10 01:50:11,187 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 531 transitions. Word has length 81 [2022-01-10 01:50:11,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:11,187 INFO L470 AbstractCegarLoop]: Abstraction has 350 states and 531 transitions. [2022-01-10 01:50:11,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-01-10 01:50:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 531 transitions. [2022-01-10 01:50:11,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-01-10 01:50:11,191 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:11,191 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:11,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:11,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-10 01:50:11,420 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:11,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:11,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1383247446, now seen corresponding path program 1 times [2022-01-10 01:50:11,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:11,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665907705] [2022-01-10 01:50:11,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:11,420 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:11,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-01-10 01:50:11,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:11,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 01:50:11,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:50:11,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:50:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-01-10 01:50:11,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-01-10 01:50:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2022-01-10 01:50:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2022-01-10 01:50:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-01-10 01:50:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-01-10 01:50:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-01-10 01:50:11,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-01-10 01:50:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-01-10 01:50:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-01-10 01:50:11,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:11,817 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-01-10 01:50:11,817 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:11,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665907705] [2022-01-10 01:50:11,818 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665907705] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:11,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823714610] [2022-01-10 01:50:11,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:11,819 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:11,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:11,820 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:11,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 01:50:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:12,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 2184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 01:50:12,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:12,925 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-01-10 01:50:12,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 677 trivial. 0 not checked. [2022-01-10 01:50:13,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823714610] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:13,301 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:13,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 9 [2022-01-10 01:50:13,301 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249725020] [2022-01-10 01:50:13,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:13,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 01:50:13,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:13,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 01:50:13,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:50:13,303 INFO L87 Difference]: Start difference. First operand 350 states and 531 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-01-10 01:50:15,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 01:50:16,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:16,144 INFO L93 Difference]: Finished difference Result 719 states and 1092 transitions. [2022-01-10 01:50:16,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 01:50:16,144 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 183 [2022-01-10 01:50:16,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:16,147 INFO L225 Difference]: With dead ends: 719 [2022-01-10 01:50:16,147 INFO L226 Difference]: Without dead ends: 381 [2022-01-10 01:50:16,149 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 410 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-01-10 01:50:16,150 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 108 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 175 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 929 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:16,150 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 929 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 557 Invalid, 1 Unknown, 0 Unchecked, 2.8s Time] [2022-01-10 01:50:16,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2022-01-10 01:50:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2022-01-10 01:50:16,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3983402489626555) internal successors, (337), 243 states have internal predecessors, (337), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-01-10 01:50:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 547 transitions. [2022-01-10 01:50:16,186 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 547 transitions. Word has length 183 [2022-01-10 01:50:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:16,187 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 547 transitions. [2022-01-10 01:50:16,187 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (45), 6 states have call predecessors, (45), 2 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-01-10 01:50:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 547 transitions. [2022-01-10 01:50:16,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2022-01-10 01:50:16,215 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:16,216 INFO L514 BasicCegarLoop]: trace histogram [18, 18, 18, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:16,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:16,435 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:16,436 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:16,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash -945252521, now seen corresponding path program 2 times [2022-01-10 01:50:16,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:16,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100177943] [2022-01-10 01:50:16,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:16,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:26,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:26,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-10 01:50:26,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:27,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 01:50:27,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:27,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:50:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:50:27,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-01-10 01:50:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-01-10 01:50:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-01-10 01:50:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-01-10 01:50:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-01-10 01:50:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-01-10 01:50:27,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-01-10 01:50:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2022-01-10 01:50:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2022-01-10 01:50:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-01-10 01:50:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 706 trivial. 0 not checked. [2022-01-10 01:50:27,243 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:27,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100177943] [2022-01-10 01:50:27,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100177943] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:27,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282513922] [2022-01-10 01:50:27,244 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 01:50:27,244 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:27,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:27,245 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:27,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 01:50:28,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 01:50:28,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 01:50:28,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 1583 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 01:50:28,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:28,540 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2022-01-10 01:50:28,541 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:50:28,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282513922] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:28,541 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:50:28,541 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2022-01-10 01:50:28,541 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711671882] [2022-01-10 01:50:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:28,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 01:50:28,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:28,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 01:50:28,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:50:28,542 INFO L87 Difference]: Start difference. First operand 363 states and 547 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-01-10 01:50:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:28,565 INFO L93 Difference]: Finished difference Result 695 states and 1053 transitions. [2022-01-10 01:50:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 01:50:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 192 [2022-01-10 01:50:28,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:28,568 INFO L225 Difference]: With dead ends: 695 [2022-01-10 01:50:28,568 INFO L226 Difference]: Without dead ends: 363 [2022-01-10 01:50:28,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-01-10 01:50:28,570 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 0 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:28,570 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 562 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 01:50:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-01-10 01:50:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2022-01-10 01:50:28,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 241 states have (on average 1.3941908713692945) internal successors, (336), 243 states have internal predecessors, (336), 99 states have call successors, (99), 20 states have call predecessors, (99), 22 states have return successors, (111), 99 states have call predecessors, (111), 99 states have call successors, (111) [2022-01-10 01:50:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 546 transitions. [2022-01-10 01:50:28,590 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 546 transitions. Word has length 192 [2022-01-10 01:50:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:28,590 INFO L470 AbstractCegarLoop]: Abstraction has 363 states and 546 transitions. [2022-01-10 01:50:28,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2022-01-10 01:50:28,590 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 546 transitions. [2022-01-10 01:50:28,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-01-10 01:50:28,594 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:28,594 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:28,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:28,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:28,819 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:28,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:28,820 INFO L85 PathProgramCache]: Analyzing trace with hash 342116215, now seen corresponding path program 1 times [2022-01-10 01:50:28,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:28,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461667589] [2022-01-10 01:50:28,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:28,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:29,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:50:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-01-10 01:50:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-01-10 01:50:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:29,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 01:50:29,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:50:29,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:50:29,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:29,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-01-10 01:50:29,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-01-10 01:50:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-01-10 01:50:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-01-10 01:50:29,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-01-10 01:50:29,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-01-10 01:50:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-01-10 01:50:29,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-01-10 01:50:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 206 [2022-01-10 01:50:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-01-10 01:50:29,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:29,439 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2022-01-10 01:50:29,439 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:29,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461667589] [2022-01-10 01:50:29,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461667589] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:29,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573973463] [2022-01-10 01:50:29,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:29,440 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:29,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:29,441 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:29,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 01:50:30,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:30,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 2532 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:50:30,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:30,562 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 16 [2022-01-10 01:50:30,623 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-01-10 01:50:30,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 01:50:31,001 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 400 proven. 5 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-01-10 01:50:31,001 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 01:50:31,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-01-10 01:50:31,550 INFO L134 CoverageAnalysis]: Checked inductivity of 906 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 901 trivial. 0 not checked. [2022-01-10 01:50:31,550 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573973463] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 01:50:31,551 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 01:50:31,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2022-01-10 01:50:31,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264506665] [2022-01-10 01:50:31,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 01:50:31,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 01:50:31,552 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:31,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 01:50:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-01-10 01:50:31,553 INFO L87 Difference]: Start difference. First operand 363 states and 546 transitions. Second operand has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 10 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41) [2022-01-10 01:50:33,596 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 01:50:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:35,928 INFO L93 Difference]: Finished difference Result 845 states and 1305 transitions. [2022-01-10 01:50:35,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 01:50:35,929 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 10 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41) Word has length 220 [2022-01-10 01:50:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:35,935 INFO L225 Difference]: With dead ends: 845 [2022-01-10 01:50:35,935 INFO L226 Difference]: Without dead ends: 815 [2022-01-10 01:50:35,936 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 497 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2022-01-10 01:50:35,936 INFO L933 BasicCegarLoop]: 270 mSDtfsCounter, 1082 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 1034 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1034 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:35,937 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1094 Valid, 1290 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1034 Valid, 1820 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2022-01-10 01:50:35,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2022-01-10 01:50:35,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 754. [2022-01-10 01:50:35,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 489 states have (on average 1.4110429447852761) internal successors, (690), 496 states have internal predecessors, (690), 215 states have call successors, (215), 40 states have call predecessors, (215), 49 states have return successors, (265), 217 states have call predecessors, (265), 215 states have call successors, (265) [2022-01-10 01:50:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1170 transitions. [2022-01-10 01:50:35,987 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1170 transitions. Word has length 220 [2022-01-10 01:50:35,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:35,987 INFO L470 AbstractCegarLoop]: Abstraction has 754 states and 1170 transitions. [2022-01-10 01:50:35,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.214285714285714) internal successors, (129), 10 states have internal predecessors, (129), 10 states have call successors, (41), 8 states have call predecessors, (41), 7 states have return successors, (41), 10 states have call predecessors, (41), 10 states have call successors, (41) [2022-01-10 01:50:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1170 transitions. [2022-01-10 01:50:35,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-01-10 01:50:35,993 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:35,993 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:36,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:36,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:36,207 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:36,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:36,208 INFO L85 PathProgramCache]: Analyzing trace with hash -2140464665, now seen corresponding path program 1 times [2022-01-10 01:50:36,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:36,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607209190] [2022-01-10 01:50:36,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:36,208 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:50:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 01:50:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:36,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 01:50:36,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:50:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:50:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-01-10 01:50:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-10 01:50:36,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-10 01:50:36,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-10 01:50:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-10 01:50:36,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-10 01:50:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-01-10 01:50:36,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-01-10 01:50:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-01-10 01:50:36,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-10 01:50:36,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 904 trivial. 0 not checked. [2022-01-10 01:50:36,827 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:36,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607209190] [2022-01-10 01:50:36,828 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607209190] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:36,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434231740] [2022-01-10 01:50:36,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:36,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:36,829 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:36,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 01:50:37,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:37,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 2499 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-10 01:50:37,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:37,887 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 01:50:37,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 01:50:37,963 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2022-01-10 01:50:38,187 INFO L134 CoverageAnalysis]: Checked inductivity of 907 backedges. 186 proven. 0 refuted. 0 times theorem prover too weak. 721 trivial. 0 not checked. [2022-01-10 01:50:38,187 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:50:38,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434231740] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:38,188 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:50:38,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 9 [2022-01-10 01:50:38,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909695030] [2022-01-10 01:50:38,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:38,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 01:50:38,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:38,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 01:50:38,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-01-10 01:50:38,189 INFO L87 Difference]: Start difference. First operand 754 states and 1170 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2022-01-10 01:50:38,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:38,315 INFO L93 Difference]: Finished difference Result 1490 states and 2309 transitions. [2022-01-10 01:50:38,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:50:38,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 221 [2022-01-10 01:50:38,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:38,322 INFO L225 Difference]: With dead ends: 1490 [2022-01-10 01:50:38,323 INFO L226 Difference]: Without dead ends: 770 [2022-01-10 01:50:38,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 274 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-10 01:50:38,327 INFO L933 BasicCegarLoop]: 365 mSDtfsCounter, 301 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:38,327 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [311 Valid, 971 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 01:50:38,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-01-10 01:50:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 760. [2022-01-10 01:50:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 760 states, 493 states have (on average 1.407707910750507) internal successors, (694), 502 states have internal predecessors, (694), 215 states have call successors, (215), 40 states have call predecessors, (215), 51 states have return successors, (268), 217 states have call predecessors, (268), 215 states have call successors, (268) [2022-01-10 01:50:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 1177 transitions. [2022-01-10 01:50:38,369 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 1177 transitions. Word has length 221 [2022-01-10 01:50:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:38,370 INFO L470 AbstractCegarLoop]: Abstraction has 760 states and 1177 transitions. [2022-01-10 01:50:38,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2022-01-10 01:50:38,370 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1177 transitions. [2022-01-10 01:50:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-01-10 01:50:38,374 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:38,375 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:38,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:38,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:38,599 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:38,600 INFO L85 PathProgramCache]: Analyzing trace with hash -26567542, now seen corresponding path program 1 times [2022-01-10 01:50:38,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:38,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831117211] [2022-01-10 01:50:38,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:38,600 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 01:50:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-01-10 01:50:49,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:49,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:49,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-01-10 01:50:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 01:50:49,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:49,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-01-10 01:50:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-01-10 01:50:49,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-01-10 01:50:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:49,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-01-10 01:50:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-01-10 01:50:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-01-10 01:50:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-01-10 01:50:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-01-10 01:50:49,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-01-10 01:50:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-01-10 01:50:49,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-01-10 01:50:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-01-10 01:50:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-01-10 01:50:49,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-01-10 01:50:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-01-10 01:50:49,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-01-10 01:50:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-01-10 01:50:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:49,498 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 8 proven. 9 refuted. 0 times theorem prover too weak. 893 trivial. 0 not checked. [2022-01-10 01:50:49,498 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 01:50:49,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831117211] [2022-01-10 01:50:49,498 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831117211] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 01:50:49,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145919233] [2022-01-10 01:50:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:49,498 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:49,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 01:50:49,499 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 01:50:49,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 01:50:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 01:50:50,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 2496 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-10 01:50:50,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 01:50:51,331 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 566 trivial. 0 not checked. [2022-01-10 01:50:51,331 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 01:50:51,332 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145919233] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 01:50:51,332 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 01:50:51,332 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [12] total 15 [2022-01-10 01:50:51,332 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785912124] [2022-01-10 01:50:51,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 01:50:51,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 01:50:51,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 01:50:51,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 01:50:51,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-01-10 01:50:51,333 INFO L87 Difference]: Start difference. First operand 760 states and 1177 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-01-10 01:50:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 01:50:52,219 INFO L93 Difference]: Finished difference Result 1749 states and 2875 transitions. [2022-01-10 01:50:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 01:50:52,220 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) Word has length 221 [2022-01-10 01:50:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 01:50:52,227 INFO L225 Difference]: With dead ends: 1749 [2022-01-10 01:50:52,228 INFO L226 Difference]: Without dead ends: 1013 [2022-01-10 01:50:52,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-01-10 01:50:52,234 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 463 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-10 01:50:52,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [490 Valid, 634 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-10 01:50:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-01-10 01:50:52,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 975. [2022-01-10 01:50:52,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 975 states, 684 states have (on average 1.2997076023391814) internal successors, (889), 586 states have internal predecessors, (889), 225 states have call successors, (225), 41 states have call predecessors, (225), 65 states have return successors, (418), 347 states have call predecessors, (418), 225 states have call successors, (418) [2022-01-10 01:50:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 975 states to 975 states and 1532 transitions. [2022-01-10 01:50:52,335 INFO L78 Accepts]: Start accepts. Automaton has 975 states and 1532 transitions. Word has length 221 [2022-01-10 01:50:52,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 01:50:52,337 INFO L470 AbstractCegarLoop]: Abstraction has 975 states and 1532 transitions. [2022-01-10 01:50:52,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 7 states have internal predecessors, (85), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 5 states have call predecessors, (24), 3 states have call successors, (24) [2022-01-10 01:50:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 975 states and 1532 transitions. [2022-01-10 01:50:52,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-01-10 01:50:52,342 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 01:50:52,342 INFO L514 BasicCegarLoop]: trace histogram [20, 20, 20, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 01:50:52,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 01:50:52,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 01:50:52,555 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 01:50:52,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 01:50:52,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1284482888, now seen corresponding path program 1 times [2022-01-10 01:50:52,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 01:50:52,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115425525] [2022-01-10 01:50:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 01:50:52,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms