/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/array-tiling/mlceu2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 08:50:44,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 08:50:44,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 08:50:44,440 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 08:50:44,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 08:50:44,443 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 08:50:44,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 08:50:44,448 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 08:50:44,449 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 08:50:44,454 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 08:50:44,455 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 08:50:44,457 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 08:50:44,457 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 08:50:44,459 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 08:50:44,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 08:50:44,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 08:50:44,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 08:50:44,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 08:50:44,464 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 08:50:44,469 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 08:50:44,470 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 08:50:44,470 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 08:50:44,472 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 08:50:44,473 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 08:50:44,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 08:50:44,480 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 08:50:44,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 08:50:44,482 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 08:50:44,482 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 08:50:44,483 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 08:50:44,483 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 08:50:44,483 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 08:50:44,485 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 08:50:44,485 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 08:50:44,486 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 08:50:44,486 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 08:50:44,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 08:50:44,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 08:50:44,487 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 08:50:44,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 08:50:44,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 08:50:44,489 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 08:50:44,517 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 08:50:44,517 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 08:50:44,517 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 08:50:44,518 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 08:50:44,518 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 08:50:44,518 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 08:50:44,519 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 08:50:44,519 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 08:50:44,519 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 08:50:44,519 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 08:50:44,520 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 08:50:44,520 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 08:50:44,520 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 08:50:44,520 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 08:50:44,520 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 08:50:44,520 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 08:50:44,521 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 08:50:44,521 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 08:50:44,521 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 08:50:44,521 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 08:50:44,522 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 08:50:44,522 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 08:50:44,522 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 08:50:44,522 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 08:50:44,522 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 08:50:44,522 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 08:50:44,523 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 08:50:44,523 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 08:50:44,523 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 08:50:44,523 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 08:50:44,523 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 08:50:44,523 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 08:50:44,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 08:50:44,524 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 08:50:44,524 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 08:50:44,524 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 08:50:44,524 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 08:50:44,524 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 08:50:44,524 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 08:50:44,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 08:50:44,525 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 08:50:44,525 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.plugins.sifa: Abstract Domain -> EqDomain [2023-04-01 08:50:44,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 08:50:44,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 08:50:44,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 08:50:44,799 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 08:50:44,799 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 08:50:44,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-tiling/mlceu2.c [2023-04-01 08:50:45,960 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 08:50:46,148 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 08:50:46,148 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mlceu2.c [2023-04-01 08:50:46,154 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ea1fcfd/1154f44ab02641f799851fd3bb64d541/FLAG5cf06afb6 [2023-04-01 08:50:46,170 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45ea1fcfd/1154f44ab02641f799851fd3bb64d541 [2023-04-01 08:50:46,174 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 08:50:46,175 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 08:50:46,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 08:50:46,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 08:50:46,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 08:50:46,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36bccc17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46, skipping insertion in model container [2023-04-01 08:50:46,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 08:50:46,204 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 08:50:46,309 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mlceu2.c[397,410] [2023-04-01 08:50:46,321 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 08:50:46,329 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 08:50:46,337 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-tiling/mlceu2.c[397,410] [2023-04-01 08:50:46,341 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 08:50:46,353 INFO L208 MainTranslator]: Completed translation [2023-04-01 08:50:46,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46 WrapperNode [2023-04-01 08:50:46,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 08:50:46,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 08:50:46,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 08:50:46,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 08:50:46,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,370 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,375 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,378 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,379 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 08:50:46,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 08:50:46,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 08:50:46,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 08:50:46,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (1/1) ... [2023-04-01 08:50:46,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 08:50:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:50:46,408 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) [2023-04-01 08:50:46,436 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 [2023-04-01 08:50:46,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 08:50:46,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 08:50:46,474 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 08:50:46,479 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 08:50:46,479 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 08:50:46,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 08:50:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 08:50:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 08:50:46,479 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 08:50:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 08:50:46,488 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 08:50:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 08:50:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 08:50:46,489 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 08:50:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 08:50:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 08:50:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 08:50:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 08:50:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 08:50:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 08:50:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 08:50:46,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 08:50:46,549 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 08:50:46,551 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 08:50:46,669 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 08:50:46,706 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 08:50:46,706 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-04-01 08:50:46,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:50:46 BoogieIcfgContainer [2023-04-01 08:50:46,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 08:50:46,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 08:50:46,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 08:50:46,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 08:50:46,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 08:50:46" (1/3) ... [2023-04-01 08:50:46,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4a4624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:50:46, skipping insertion in model container [2023-04-01 08:50:46,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 08:50:46" (2/3) ... [2023-04-01 08:50:46,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4a4624 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 08:50:46, skipping insertion in model container [2023-04-01 08:50:46,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 08:50:46" (3/3) ... [2023-04-01 08:50:46,715 INFO L112 eAbstractionObserver]: Analyzing ICFG mlceu2.c [2023-04-01 08:50:46,732 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 08:50:46,732 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 08:50:46,789 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 08:50:46,797 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@15ec14ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 08:50:46,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 08:50:46,801 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 08:50:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-01 08:50:46,807 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:50:46,821 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:50:46,822 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:50:46,826 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:50:46,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1075306796, now seen corresponding path program 1 times [2023-04-01 08:50:46,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:50:46,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966887217] [2023-04-01 08:50:46,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:50:46,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:50:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:50:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:47,152 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:50:47,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966887217] [2023-04-01 08:50:47,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966887217] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 08:50:47,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 08:50:47,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 08:50:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268281570] [2023-04-01 08:50:47,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 08:50:47,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 08:50:47,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:50:47,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 08:50:47,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 08:50:47,204 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 08:50:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:50:47,260 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2023-04-01 08:50:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 08:50:47,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-01 08:50:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:50:47,268 INFO L225 Difference]: With dead ends: 34 [2023-04-01 08:50:47,268 INFO L226 Difference]: Without dead ends: 17 [2023-04-01 08:50:47,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 08:50:47,275 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 08:50:47,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 08:50:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-04-01 08:50:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2023-04-01 08:50:47,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 08:50:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2023-04-01 08:50:47,301 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2023-04-01 08:50:47,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:50:47,301 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2023-04-01 08:50:47,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 08:50:47,301 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2023-04-01 08:50:47,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 08:50:47,302 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:50:47,302 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:50:47,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 08:50:47,303 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:50:47,303 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:50:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash -318170544, now seen corresponding path program 1 times [2023-04-01 08:50:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:50:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739696122] [2023-04-01 08:50:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:50:47,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:50:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:50:47,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:47,396 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:50:47,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739696122] [2023-04-01 08:50:47,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739696122] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:50:47,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115553937] [2023-04-01 08:50:47,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:50:47,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:50:47,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:50:47,400 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) [2023-04-01 08:50:47,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 08:50:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:50:47,466 INFO L262 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 08:50:47,471 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:50:47,539 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:47,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:50:47,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:47,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115553937] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 08:50:47,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1359008561] [2023-04-01 08:50:47,628 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-04-01 08:50:47,628 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:50:47,630 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:50:47,634 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:50:47,635 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:50:47,808 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:50:48,328 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 78 for LOIs [2023-04-01 08:50:48,398 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:50:48,405 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:50:49,294 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '180#(and (= ~MAX~0 100000) (not (= ~SIZE~0 100000)) (= |__VERIFIER_assert_#in~cond| 0) (< 0 ~SIZE~0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (exists ((v_main_~a~0.base_BEFORE_CALL_1 Int) (|v_old(#length)_BEFORE_CALL_1| (Array Int Int)) (|v_old(#memory_int)_BEFORE_CALL_1| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_1| (Array Int Int))) (and (= (select |v_old(#valid)_BEFORE_CALL_1| 3) 1) (not (= |v_old(#valid)_BEFORE_CALL_1| |v_old(#length)_BEFORE_CALL_1|)) (= (select |v_old(#length)_BEFORE_CALL_1| 3) 12) (not (= (select |v_old(#memory_int)_BEFORE_CALL_1| 1) |v_old(#valid)_BEFORE_CALL_1|)) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_1| 1) 0)) (= (select |v_old(#valid)_BEFORE_CALL_1| 1) 1) (not (= v_main_~a~0.base_BEFORE_CALL_1 0)) (not (= v_main_~a~0.base_BEFORE_CALL_1 3)) (= (select |v_old(#valid)_BEFORE_CALL_1| v_main_~a~0.base_BEFORE_CALL_1) 0) (= 2 (select |v_old(#length)_BEFORE_CALL_1| 1)) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_1) 0) 0)) (= (select |v_old(#valid)_BEFORE_CALL_1| 2) 1) (not (= v_main_~a~0.base_BEFORE_CALL_1 1)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_1| 1) |v_old(#length)_BEFORE_CALL_1|)) (not (= v_main_~a~0.base_BEFORE_CALL_1 |#StackHeapBarrier|)) (= (select |v_old(#length)_BEFORE_CALL_1| 2) 9) (= (select |v_old(#valid)_BEFORE_CALL_1| 0) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_1| 1) 1) 0) (not (= v_main_~a~0.base_BEFORE_CALL_1 2)))) (= |#NULL.base| 0))' at error location [2023-04-01 08:50:49,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:50:49,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 08:50:49,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-04-01 08:50:49,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928982679] [2023-04-01 08:50:49,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 08:50:49,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 08:50:49,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:50:49,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 08:50:49,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-04-01 08:50:49,298 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 08:50:49,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:50:49,335 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2023-04-01 08:50:49,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 08:50:49,336 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-04-01 08:50:49,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:50:49,337 INFO L225 Difference]: With dead ends: 27 [2023-04-01 08:50:49,337 INFO L226 Difference]: Without dead ends: 18 [2023-04-01 08:50:49,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2023-04-01 08:50:49,339 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 08:50:49,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 29 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 08:50:49,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-04-01 08:50:49,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-04-01 08:50:49,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 08:50:49,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-04-01 08:50:49,343 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2023-04-01 08:50:49,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:50:49,343 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-04-01 08:50:49,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 08:50:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-04-01 08:50:49,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-04-01 08:50:49,344 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:50:49,344 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:50:49,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 08:50:49,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:50:49,551 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:50:49,552 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:50:49,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1678216788, now seen corresponding path program 2 times [2023-04-01 08:50:49,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:50:49,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800403402] [2023-04-01 08:50:49,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:50:49,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:50:49,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:50:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:50,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:50:50,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800403402] [2023-04-01 08:50:50,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800403402] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:50:50,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119014112] [2023-04-01 08:50:50,015 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 08:50:50,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:50:50,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:50:50,017 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) [2023-04-01 08:50:50,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 08:50:50,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 08:50:50,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 08:50:50,084 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 08:50:50,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:50:50,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-04-01 08:50:50,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2023-04-01 08:50:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:50,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:50:50,261 INFO L350 Elim1Store]: Elim1 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 [2023-04-01 08:50:50,311 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 08:50:50,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 50 [2023-04-01 08:50:50,321 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 08:50:50,321 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 13 treesize of output 12 [2023-04-01 08:50:50,361 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-01 08:50:50,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 41 [2023-04-01 08:50:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:50,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119014112] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 08:50:50,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1350867663] [2023-04-01 08:50:50,386 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2023-04-01 08:50:50,386 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:50:50,387 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:50:50,387 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:50:50,387 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:50:50,459 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:50:50,701 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 78 for LOIs [2023-04-01 08:50:50,752 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:50:50,757 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:50:51,622 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '357#(and (= ~MAX~0 100000) (exists ((v_main_~a~0.base_BEFORE_CALL_2 Int) (|v_old(#valid)_BEFORE_CALL_2| (Array Int Int)) (|v_old(#length)_BEFORE_CALL_2| (Array Int Int)) (|v_old(#memory_int)_BEFORE_CALL_2| (Array Int (Array Int Int)))) (and (not (= v_main_~a~0.base_BEFORE_CALL_2 1)) (= (select |v_old(#valid)_BEFORE_CALL_2| v_main_~a~0.base_BEFORE_CALL_2) 0) (= 2 (select |v_old(#length)_BEFORE_CALL_2| 1)) (not (= v_main_~a~0.base_BEFORE_CALL_2 0)) (= (select |v_old(#length)_BEFORE_CALL_2| 3) 12) (= (select (select |v_old(#memory_int)_BEFORE_CALL_2| 1) 1) 0) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_2) 0) 0)) (= (select |v_old(#length)_BEFORE_CALL_2| 2) 9) (= (select |v_old(#valid)_BEFORE_CALL_2| 0) 0) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_2| 1) 0)) (not (= |v_old(#length)_BEFORE_CALL_2| (select |v_old(#memory_int)_BEFORE_CALL_2| 1))) (not (= |v_old(#valid)_BEFORE_CALL_2| (select |v_old(#memory_int)_BEFORE_CALL_2| 1))) (not (= |v_old(#valid)_BEFORE_CALL_2| |v_old(#length)_BEFORE_CALL_2|)) (= (select |v_old(#valid)_BEFORE_CALL_2| 2) 1) (not (= v_main_~a~0.base_BEFORE_CALL_2 3)) (not (= v_main_~a~0.base_BEFORE_CALL_2 |#StackHeapBarrier|)) (= (select |v_old(#valid)_BEFORE_CALL_2| 3) 1) (not (= v_main_~a~0.base_BEFORE_CALL_2 2)) (= (select |v_old(#valid)_BEFORE_CALL_2| 1) 1))) (not (= ~SIZE~0 100000)) (= |__VERIFIER_assert_#in~cond| 0) (< 0 ~SIZE~0) (= __VERIFIER_assert_~cond 0) (not (= |#StackHeapBarrier| 0)) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 08:50:51,622 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:50:51,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 08:50:51,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2023-04-01 08:50:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109999791] [2023-04-01 08:50:51,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 08:50:51,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 08:50:51,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:50:51,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 08:50:51,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=671, Unknown=0, NotChecked=0, Total=756 [2023-04-01 08:50:51,625 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 08:50:51,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:50:51,804 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2023-04-01 08:50:51,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 08:50:51,805 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-04-01 08:50:51,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:50:51,806 INFO L225 Difference]: With dead ends: 34 [2023-04-01 08:50:51,807 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 08:50:51,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=108, Invalid=822, Unknown=0, NotChecked=0, Total=930 [2023-04-01 08:50:51,808 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 08:50:51,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 89 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 08:50:51,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 08:50:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2023-04-01 08:50:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 08:50:51,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-04-01 08:50:51,818 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 14 [2023-04-01 08:50:51,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:50:51,818 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-04-01 08:50:51,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.3125) internal successors, (21), 15 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 08:50:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-04-01 08:50:51,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 08:50:51,819 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:50:51,819 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:50:51,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 08:50:52,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-01 08:50:52,027 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:50:52,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:50:52,028 INFO L85 PathProgramCache]: Analyzing trace with hash 982770853, now seen corresponding path program 1 times [2023-04-01 08:50:52,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:50:52,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800995148] [2023-04-01 08:50:52,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:50:52,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:50:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:50:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:52,259 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:50:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800995148] [2023-04-01 08:50:52,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800995148] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:50:52,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923469286] [2023-04-01 08:50:52,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:50:52,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:50:52,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:50:52,261 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) [2023-04-01 08:50:52,283 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 08:50:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:50:52,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 08:50:52,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:50:52,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-04-01 08:50:52,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:52,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:50:52,541 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 08:50:52,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 50 [2023-04-01 08:50:52,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 08:50:52,549 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 13 treesize of output 12 [2023-04-01 08:50:52,569 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-04-01 08:50:52,574 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-01 08:50:52,575 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 17 [2023-04-01 08:50:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 08:50:52,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923469286] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 08:50:52,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1930616694] [2023-04-01 08:50:52,588 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 08:50:52,588 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:50:52,588 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:50:52,588 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:50:52,588 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:50:52,628 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:50:53,774 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 93 for LOIs [2023-04-01 08:50:53,936 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:50:53,941 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:50:55,313 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '605#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.offset_BEFORE_CALL_17 Int) (|v_old(#length)_BEFORE_CALL_15| (Array Int Int)) (|v_old(#memory_int)_BEFORE_CALL_15| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_15| (Array Int Int)) (v_main_~a~0.base_BEFORE_CALL_17 Int) (|v_old(~SIZE~0)_BEFORE_CALL_15| Int) (v_main_~i~0_BEFORE_CALL_17 Int)) (and (or (and (not (= v_main_~a~0.base_BEFORE_CALL_17 2)) (= v_main_~a~0.offset_BEFORE_CALL_17 0) (= (select |v_old(#valid)_BEFORE_CALL_15| 2) 1) (not (= v_main_~a~0.base_BEFORE_CALL_17 3)) (= (select |v_old(#valid)_BEFORE_CALL_15| v_main_~a~0.base_BEFORE_CALL_17) 0) (= ~MAX~0 100000) (= (select |v_old(#length)_BEFORE_CALL_15| 3) 12) (= |v_old(~SIZE~0)_BEFORE_CALL_15| 0) (= (select |v_old(#valid)_BEFORE_CALL_15| 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_17 |#StackHeapBarrier|)) (not (= |v_old(#valid)_BEFORE_CALL_15| |v_old(#length)_BEFORE_CALL_15|)) (not (= ~SIZE~0 100000)) (not (= v_main_~a~0.base_BEFORE_CALL_17 0)) (not (= |v_old(#valid)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 0) 48) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_17 1)) (= (select |v_old(#length)_BEFORE_CALL_15| 1) 2) (= (select |v_old(#valid)_BEFORE_CALL_15| 1) 1) (= v_main_~i~0_BEFORE_CALL_17 0) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (= (select |v_old(#length)_BEFORE_CALL_15| 2) 9) (not (= |v_old(#length)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= (select |v_old(#valid)_BEFORE_CALL_15| 3) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 1) 0) (= |#NULL.base| 0)) (and (not (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_17) (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (not (= v_main_~a~0.base_BEFORE_CALL_17 2)) (= v_main_~a~0.offset_BEFORE_CALL_17 0) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_17) 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_15| 2) 1) (not (= v_main_~a~0.base_BEFORE_CALL_17 3)) (= (select |v_old(#valid)_BEFORE_CALL_15| v_main_~a~0.base_BEFORE_CALL_17) 0) (= ~MAX~0 100000) (= (select |v_old(#length)_BEFORE_CALL_15| 3) 12) (= |v_old(~SIZE~0)_BEFORE_CALL_15| 0) (= (select |v_old(#valid)_BEFORE_CALL_15| 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_17 |#StackHeapBarrier|)) (not (= |v_old(#valid)_BEFORE_CALL_15| |v_old(#length)_BEFORE_CALL_15|)) (not (= ~SIZE~0 100000)) (not (= v_main_~a~0.base_BEFORE_CALL_17 0)) (not (= |v_old(#valid)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 0) 48) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_17 1)) (= (select |v_old(#length)_BEFORE_CALL_15| 1) 2) (= (select |v_old(#valid)_BEFORE_CALL_15| 1) 1) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (= (select |v_old(#length)_BEFORE_CALL_15| 2) 9) (not (= |v_old(#length)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= (select |v_old(#valid)_BEFORE_CALL_15| 3) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 1) 0) (= |#NULL.base| 0))) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_17) (+ v_main_~a~0.offset_BEFORE_CALL_17 (* v_main_~i~0_BEFORE_CALL_17 4))) 0)) (< v_main_~i~0_BEFORE_CALL_17 ~SIZE~0))))' at error location [2023-04-01 08:50:55,314 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:50:55,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 08:50:55,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 19 [2023-04-01 08:50:55,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968609118] [2023-04-01 08:50:55,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 08:50:55,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 08:50:55,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:50:55,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 08:50:55,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=891, Unknown=6, NotChecked=0, Total=992 [2023-04-01 08:50:55,315 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 08:50:55,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:50:55,464 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-04-01 08:50:55,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 08:50:55,466 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2023-04-01 08:50:55,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:50:55,467 INFO L225 Difference]: With dead ends: 34 [2023-04-01 08:50:55,467 INFO L226 Difference]: Without dead ends: 32 [2023-04-01 08:50:55,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=123, Invalid=1131, Unknown=6, NotChecked=0, Total=1260 [2023-04-01 08:50:55,468 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 08:50:55,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 125 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 08:50:55,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-04-01 08:50:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-04-01 08:50:55,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 08:50:55,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-04-01 08:50:55,475 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2023-04-01 08:50:55,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:50:55,475 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-04-01 08:50:55,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 17 states have internal predecessors, (30), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 08:50:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-04-01 08:50:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-04-01 08:50:55,477 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:50:55,477 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:50:55,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 08:50:55,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:50:55,681 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:50:55,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:50:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1311112908, now seen corresponding path program 2 times [2023-04-01 08:50:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:50:55,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758411932] [2023-04-01 08:50:55,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:50:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:50:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:50:55,763 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 08:50:55,763 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:50:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758411932] [2023-04-01 08:50:55,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758411932] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:50:55,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288151090] [2023-04-01 08:50:55,764 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 08:50:55,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:50:55,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:50:55,765 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) [2023-04-01 08:50:55,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 08:50:55,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 08:50:55,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 08:50:55,821 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 08:50:55,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:50:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 08:50:55,902 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:50:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 08:50:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288151090] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 08:50:55,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1000046783] [2023-04-01 08:50:55,977 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 08:50:55,977 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:50:55,977 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:50:55,977 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:50:55,977 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:50:56,019 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:50:56,962 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 93 for LOIs [2023-04-01 08:50:57,140 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:50:57,144 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:50:58,305 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '902#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.base_BEFORE_CALL_30 Int) (|v_old(#memory_int)_BEFORE_CALL_28| (Array Int (Array Int Int))) (|v_old(#length)_BEFORE_CALL_28| (Array Int Int)) (v_main_~i~0_BEFORE_CALL_34 Int) (|v_old(#valid)_BEFORE_CALL_28| (Array Int Int)) (v_main_~a~0.offset_BEFORE_CALL_30 Int) (|v_old(~SIZE~0)_BEFORE_CALL_28| Int)) (and (< v_main_~i~0_BEFORE_CALL_34 ~SIZE~0) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_30) (+ v_main_~a~0.offset_BEFORE_CALL_30 (* v_main_~i~0_BEFORE_CALL_34 4))) 0)) (or (and (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_28| 1) 0)) (= (select |v_old(#valid)_BEFORE_CALL_28| v_main_~a~0.base_BEFORE_CALL_30) 0) (= ~MAX~0 100000) (not (= v_main_~a~0.base_BEFORE_CALL_30 0)) (not (= v_main_~a~0.base_BEFORE_CALL_30 3)) (not (= v_main_~a~0.base_BEFORE_CALL_30 1)) (= (select |v_old(#length)_BEFORE_CALL_28| 2) 9) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_30) 0) 0) (not (= ~SIZE~0 100000)) (= (select |v_old(#valid)_BEFORE_CALL_28| 3) 1) (not (= (select |v_old(#memory_int)_BEFORE_CALL_28| 1) |v_old(#valid)_BEFORE_CALL_28|)) (= (select |v_old(#valid)_BEFORE_CALL_28| 0) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_28| 1) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_30))) (= v_main_~a~0.offset_BEFORE_CALL_30 0) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_30 2)) (= (select |v_old(#valid)_BEFORE_CALL_28| 1) 1) (not (= v_main_~a~0.base_BEFORE_CALL_30 |#StackHeapBarrier|)) (not (= ~SIZE~0 1)) (= (select |v_old(#length)_BEFORE_CALL_28| 3) 12) (= (select (select |v_old(#memory_int)_BEFORE_CALL_28| 1) 1) 0) (not (= |v_old(#valid)_BEFORE_CALL_28| |v_old(#length)_BEFORE_CALL_28|)) (= |#NULL.offset| 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_28| 1) |v_old(#length)_BEFORE_CALL_28|)) (= (select |v_old(#valid)_BEFORE_CALL_28| 2) 1) (= |v_old(~SIZE~0)_BEFORE_CALL_28| 0) (= 2 (select |v_old(#length)_BEFORE_CALL_28| 1)) (= |#NULL.base| 0)) (and (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_28| 1) 0)) (= (select |v_old(#valid)_BEFORE_CALL_28| v_main_~a~0.base_BEFORE_CALL_30) 0) (= ~MAX~0 100000) (not (= v_main_~a~0.base_BEFORE_CALL_30 0)) (= v_main_~i~0_BEFORE_CALL_34 0) (not (= v_main_~a~0.base_BEFORE_CALL_30 3)) (not (= v_main_~a~0.base_BEFORE_CALL_30 1)) (= (select |v_old(#length)_BEFORE_CALL_28| 2) 9) (not (= ~SIZE~0 100000)) (= (select |v_old(#valid)_BEFORE_CALL_28| 3) 1) (not (= (select |v_old(#memory_int)_BEFORE_CALL_28| 1) |v_old(#valid)_BEFORE_CALL_28|)) (= (select |v_old(#valid)_BEFORE_CALL_28| 0) 0) (= v_main_~a~0.offset_BEFORE_CALL_30 0) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_30 2)) (= (select |v_old(#valid)_BEFORE_CALL_28| 1) 1) (not (= v_main_~a~0.base_BEFORE_CALL_30 |#StackHeapBarrier|)) (not (= ~SIZE~0 1)) (= (select |v_old(#length)_BEFORE_CALL_28| 3) 12) (= (select (select |v_old(#memory_int)_BEFORE_CALL_28| 1) 1) 0) (not (= |v_old(#valid)_BEFORE_CALL_28| |v_old(#length)_BEFORE_CALL_28|)) (= |#NULL.offset| 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_28| 1) |v_old(#length)_BEFORE_CALL_28|)) (= (select |v_old(#valid)_BEFORE_CALL_28| 2) 1) (= |v_old(~SIZE~0)_BEFORE_CALL_28| 0) (= 2 (select |v_old(#length)_BEFORE_CALL_28| 1)) (= |#NULL.base| 0))))))' at error location [2023-04-01 08:50:58,305 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:50:58,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 08:50:58,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 14 [2023-04-01 08:50:58,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933613634] [2023-04-01 08:50:58,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 08:50:58,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-04-01 08:50:58,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:50:58,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-04-01 08:50:58,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=608, Unknown=5, NotChecked=0, Total=702 [2023-04-01 08:50:58,308 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 08:50:58,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:50:58,419 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2023-04-01 08:50:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 08:50:58,420 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 28 [2023-04-01 08:50:58,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:50:58,421 INFO L225 Difference]: With dead ends: 60 [2023-04-01 08:50:58,421 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 08:50:58,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=108, Invalid=699, Unknown=5, NotChecked=0, Total=812 [2023-04-01 08:50:58,422 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 08:50:58,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 58 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 08:50:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 08:50:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2023-04-01 08:50:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 08:50:58,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2023-04-01 08:50:58,429 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 28 [2023-04-01 08:50:58,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:50:58,429 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2023-04-01 08:50:58,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 7 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 08:50:58,429 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2023-04-01 08:50:58,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-04-01 08:50:58,430 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:50:58,430 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:50:58,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 08:50:58,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:50:58,641 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:50:58,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:50:58,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1038910640, now seen corresponding path program 3 times [2023-04-01 08:50:58,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:50:58,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959233142] [2023-04-01 08:50:58,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:50:58,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:50:58,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:50:58,980 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 08:50:58,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:50:58,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959233142] [2023-04-01 08:50:58,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959233142] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:50:58,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729283381] [2023-04-01 08:50:58,981 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 08:50:58,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:50:58,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:50:58,985 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) [2023-04-01 08:50:58,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 08:50:59,039 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 08:50:59,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 08:50:59,040 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjunts are in the unsatisfiable core [2023-04-01 08:50:59,043 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:50:59,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-04-01 08:50:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 08:50:59,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:50:59,412 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 08:50:59,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 50 [2023-04-01 08:50:59,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 08:50:59,421 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 13 treesize of output 12 [2023-04-01 08:50:59,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 41 treesize of output 29 [2023-04-01 08:50:59,440 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-04-01 08:50:59,448 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-01 08:50:59,449 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 17 [2023-04-01 08:50:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-04-01 08:50:59,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729283381] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 08:50:59,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [488943485] [2023-04-01 08:50:59,466 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 08:50:59,467 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:50:59,467 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:50:59,467 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:50:59,467 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:50:59,511 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:51:00,410 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 93 for LOIs [2023-04-01 08:51:00,555 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:51:00,560 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:51:01,903 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1253#(and (exists ((v_main_~i~0_BEFORE_CALL_51 Int) (|v_old(~SIZE~0)_BEFORE_CALL_41| Int) (v_main_~a~0.offset_BEFORE_CALL_47 Int) (v_main_~a~0.base_BEFORE_CALL_47 Int) (|v_old(#length)_BEFORE_CALL_41| (Array Int Int)) (|v_old(#memory_int)_BEFORE_CALL_41| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_41| (Array Int Int))) (and (< v_main_~i~0_BEFORE_CALL_51 ~SIZE~0) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_47) (+ v_main_~a~0.offset_BEFORE_CALL_47 (* v_main_~i~0_BEFORE_CALL_51 4))) 0)) (or (and (not (= v_main_~a~0.base_BEFORE_CALL_47 2)) (= (select |v_old(#valid)_BEFORE_CALL_41| 1) 1) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_41| 1) 0)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_41| 1) |v_old(#length)_BEFORE_CALL_41|)) (= ~MAX~0 100000) (= 2 (select |v_old(#length)_BEFORE_CALL_41| 1)) (= 12 (select |v_old(#length)_BEFORE_CALL_41| 3)) (not (= v_main_~a~0.base_BEFORE_CALL_47 3)) (= (select |v_old(#valid)_BEFORE_CALL_41| v_main_~a~0.base_BEFORE_CALL_47) 0) (not (= |v_old(#valid)_BEFORE_CALL_41| |v_old(#length)_BEFORE_CALL_41|)) (= v_main_~i~0_BEFORE_CALL_51 0) (= (select |v_old(#valid)_BEFORE_CALL_41| 2) 1) (not (= v_main_~a~0.base_BEFORE_CALL_47 1)) (not (= ~SIZE~0 100000)) (= (select |v_old(#valid)_BEFORE_CALL_41| 0) 0) (not (= |#StackHeapBarrier| 0)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_41| 1) |v_old(#valid)_BEFORE_CALL_41|)) (not (= ~SIZE~0 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_41| 1) 1) 0) (= v_main_~a~0.offset_BEFORE_CALL_47 0) (= |#NULL.offset| 0) (not (= v_main_~a~0.base_BEFORE_CALL_47 0)) (= 9 (select |v_old(#length)_BEFORE_CALL_41| 2)) (not (= v_main_~a~0.base_BEFORE_CALL_47 |#StackHeapBarrier|)) (= |v_old(~SIZE~0)_BEFORE_CALL_41| 0) (= (select |v_old(#valid)_BEFORE_CALL_41| 3) 1) (= |#NULL.base| 0)) (and (not (= v_main_~a~0.base_BEFORE_CALL_47 2)) (= (select |v_old(#valid)_BEFORE_CALL_41| 1) 1) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_41| 1) 0)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_41| 1) |v_old(#length)_BEFORE_CALL_41|)) (= ~MAX~0 100000) (= 2 (select |v_old(#length)_BEFORE_CALL_41| 1)) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_47) 0) 0) (= 12 (select |v_old(#length)_BEFORE_CALL_41| 3)) (not (= v_main_~a~0.base_BEFORE_CALL_47 3)) (= (select |v_old(#valid)_BEFORE_CALL_41| v_main_~a~0.base_BEFORE_CALL_47) 0) (not (= |v_old(#valid)_BEFORE_CALL_41| |v_old(#length)_BEFORE_CALL_41|)) (= (select |v_old(#valid)_BEFORE_CALL_41| 2) 1) (not (= v_main_~a~0.base_BEFORE_CALL_47 1)) (not (= ~SIZE~0 100000)) (= (select |v_old(#valid)_BEFORE_CALL_41| 0) 0) (not (= |#StackHeapBarrier| 0)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_41| 1) |v_old(#valid)_BEFORE_CALL_41|)) (not (= ~SIZE~0 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_41| 1) 1) 0) (= v_main_~a~0.offset_BEFORE_CALL_47 0) (= |#NULL.offset| 0) (not (= v_main_~a~0.base_BEFORE_CALL_47 0)) (= 9 (select |v_old(#length)_BEFORE_CALL_41| 2)) (not (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_47) (select |v_old(#memory_int)_BEFORE_CALL_41| 1))) (not (= v_main_~a~0.base_BEFORE_CALL_47 |#StackHeapBarrier|)) (= |v_old(~SIZE~0)_BEFORE_CALL_41| 0) (= (select |v_old(#valid)_BEFORE_CALL_41| 3) 1) (= |#NULL.base| 0))))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0))' at error location [2023-04-01 08:51:01,904 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:51:01,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 08:51:01,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 25 [2023-04-01 08:51:01,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985967891] [2023-04-01 08:51:01,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 08:51:01,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 08:51:01,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:51:01,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 08:51:01,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1284, Unknown=5, NotChecked=0, Total=1406 [2023-04-01 08:51:01,906 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 7 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 08:51:02,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:51:02,190 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2023-04-01 08:51:02,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-01 08:51:02,190 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 7 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 29 [2023-04-01 08:51:02,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:51:02,191 INFO L225 Difference]: With dead ends: 42 [2023-04-01 08:51:02,191 INFO L226 Difference]: Without dead ends: 40 [2023-04-01 08:51:02,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=181, Invalid=1794, Unknown=5, NotChecked=0, Total=1980 [2023-04-01 08:51:02,193 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 20 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 08:51:02,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 143 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 08:51:02,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-04-01 08:51:02,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2023-04-01 08:51:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 08:51:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-04-01 08:51:02,203 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 29 [2023-04-01 08:51:02,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:51:02,203 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-04-01 08:51:02,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 23 states have internal predecessors, (39), 7 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 08:51:02,204 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-04-01 08:51:02,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-04-01 08:51:02,206 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:51:02,206 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:51:02,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 08:51:02,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:02,407 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:51:02,407 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:51:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash -298168631, now seen corresponding path program 4 times [2023-04-01 08:51:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:51:02,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752860154] [2023-04-01 08:51:02,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:51:02,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:51:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:51:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 08:51:02,512 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:51:02,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752860154] [2023-04-01 08:51:02,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752860154] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:51:02,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776939401] [2023-04-01 08:51:02,513 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 08:51:02,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:02,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:51:02,514 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) [2023-04-01 08:51:02,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 08:51:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:51:02,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 08:51:02,583 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:51:02,674 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 08:51:02,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:51:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 08:51:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776939401] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 08:51:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1129489123] [2023-04-01 08:51:02,729 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 08:51:02,729 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:51:02,729 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:51:02,729 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:51:02,729 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:51:02,770 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:51:03,652 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 93 for LOIs [2023-04-01 08:51:03,834 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:51:03,838 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:51:04,980 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1631#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((|v_old(#memory_int)_BEFORE_CALL_54| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_54| (Array Int Int)) (|v_old(~SIZE~0)_BEFORE_CALL_54| Int) (v_main_~a~0.offset_BEFORE_CALL_60 Int) (v_main_~a~0.base_BEFORE_CALL_60 Int) (|v_old(#length)_BEFORE_CALL_54| (Array Int Int)) (v_main_~i~0_BEFORE_CALL_70 Int)) (and (or (and (not (= v_main_~a~0.base_BEFORE_CALL_60 0)) (= (select |v_old(#valid)_BEFORE_CALL_54| v_main_~a~0.base_BEFORE_CALL_60) 0) (= ~MAX~0 100000) (not (= v_main_~a~0.base_BEFORE_CALL_60 2)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_54| 1) |v_old(#length)_BEFORE_CALL_54|)) (= 12 (select |v_old(#length)_BEFORE_CALL_54| 3)) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_60) 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_54| 2) 1) (not (= ~SIZE~0 100000)) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_54| 1) 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_54| 1) 1) 0) (not (= |#StackHeapBarrier| 0)) (= (select |v_old(#length)_BEFORE_CALL_54| 2) 9) (not (= |v_old(#valid)_BEFORE_CALL_54| (select |v_old(#memory_int)_BEFORE_CALL_54| 1))) (= v_main_~a~0.offset_BEFORE_CALL_60 0) (= 2 (select |v_old(#length)_BEFORE_CALL_54| 1)) (not (= |v_old(#valid)_BEFORE_CALL_54| |v_old(#length)_BEFORE_CALL_54|)) (not (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_60) (select |v_old(#memory_int)_BEFORE_CALL_54| 1))) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (= (select |v_old(#valid)_BEFORE_CALL_54| 1) 1) (not (= v_main_~a~0.base_BEFORE_CALL_60 3)) (= (select |v_old(#valid)_BEFORE_CALL_54| 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_54| 3) 1) (not (= v_main_~a~0.base_BEFORE_CALL_60 |#StackHeapBarrier|)) (not (= v_main_~a~0.base_BEFORE_CALL_60 1)) (= |#NULL.base| 0) (= |v_old(~SIZE~0)_BEFORE_CALL_54| 0)) (and (= v_main_~i~0_BEFORE_CALL_70 0) (not (= v_main_~a~0.base_BEFORE_CALL_60 0)) (= (select |v_old(#valid)_BEFORE_CALL_54| v_main_~a~0.base_BEFORE_CALL_60) 0) (= ~MAX~0 100000) (not (= v_main_~a~0.base_BEFORE_CALL_60 2)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_54| 1) |v_old(#length)_BEFORE_CALL_54|)) (= 12 (select |v_old(#length)_BEFORE_CALL_54| 3)) (= (select |v_old(#valid)_BEFORE_CALL_54| 2) 1) (not (= ~SIZE~0 100000)) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_54| 1) 0)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_54| 1) 1) 0) (not (= |#StackHeapBarrier| 0)) (= (select |v_old(#length)_BEFORE_CALL_54| 2) 9) (not (= |v_old(#valid)_BEFORE_CALL_54| (select |v_old(#memory_int)_BEFORE_CALL_54| 1))) (= v_main_~a~0.offset_BEFORE_CALL_60 0) (= 2 (select |v_old(#length)_BEFORE_CALL_54| 1)) (not (= |v_old(#valid)_BEFORE_CALL_54| |v_old(#length)_BEFORE_CALL_54|)) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (= (select |v_old(#valid)_BEFORE_CALL_54| 1) 1) (not (= v_main_~a~0.base_BEFORE_CALL_60 3)) (= (select |v_old(#valid)_BEFORE_CALL_54| 0) 0) (= (select |v_old(#valid)_BEFORE_CALL_54| 3) 1) (not (= v_main_~a~0.base_BEFORE_CALL_60 |#StackHeapBarrier|)) (not (= v_main_~a~0.base_BEFORE_CALL_60 1)) (= |#NULL.base| 0) (= |v_old(~SIZE~0)_BEFORE_CALL_54| 0))) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_60) (+ v_main_~a~0.offset_BEFORE_CALL_60 (* v_main_~i~0_BEFORE_CALL_70 4))) 0)) (< v_main_~i~0_BEFORE_CALL_70 ~SIZE~0))))' at error location [2023-04-01 08:51:04,981 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:51:04,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 08:51:04,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 17 [2023-04-01 08:51:04,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450015472] [2023-04-01 08:51:04,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 08:51:04,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 08:51:04,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:51:04,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 08:51:04,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=754, Unknown=5, NotChecked=0, Total=870 [2023-04-01 08:51:04,983 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 08:51:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:51:05,104 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2023-04-01 08:51:05,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 08:51:05,105 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 36 [2023-04-01 08:51:05,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:51:05,105 INFO L225 Difference]: With dead ends: 75 [2023-04-01 08:51:05,105 INFO L226 Difference]: Without dead ends: 44 [2023-04-01 08:51:05,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 83 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=144, Invalid=907, Unknown=5, NotChecked=0, Total=1056 [2023-04-01 08:51:05,106 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 10 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 08:51:05,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 82 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 08:51:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-04-01 08:51:05,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2023-04-01 08:51:05,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 08:51:05,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2023-04-01 08:51:05,114 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 36 [2023-04-01 08:51:05,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:51:05,114 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2023-04-01 08:51:05,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 17 states have internal predecessors, (36), 9 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 08:51:05,115 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2023-04-01 08:51:05,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 08:51:05,115 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:51:05,115 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:51:05,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 08:51:05,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:05,322 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:51:05,322 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:51:05,322 INFO L85 PathProgramCache]: Analyzing trace with hash 507483717, now seen corresponding path program 5 times [2023-04-01 08:51:05,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:51:05,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328906450] [2023-04-01 08:51:05,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:51:05,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:51:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:51:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 08:51:05,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:51:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328906450] [2023-04-01 08:51:05,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328906450] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:51:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35787164] [2023-04-01 08:51:05,703 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 08:51:05,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:05,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:51:05,705 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) [2023-04-01 08:51:05,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 08:51:05,800 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-04-01 08:51:05,801 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 08:51:05,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-01 08:51:05,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:51:05,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2023-04-01 08:51:05,897 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-04-01 08:51:05,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 8 treesize of output 1 [2023-04-01 08:51:06,425 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-01 08:51:06,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2023-04-01 08:51:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-04-01 08:51:06,459 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:51:06,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35787164] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:51:06,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [17862339] [2023-04-01 08:51:06,538 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 08:51:06,539 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:51:06,539 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:51:06,539 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:51:06,539 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:51:06,573 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:51:07,389 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 93 for LOIs [2023-04-01 08:51:07,527 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:51:07,531 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:51:11,705 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1980#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (exists ((v_main_~a~0.base_BEFORE_CALL_76 Int) (|v_old(#memory_int)_BEFORE_CALL_67| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_67| (Array Int Int)) (v_main_~i~0_BEFORE_CALL_86 Int) (|v_old(~SIZE~0)_BEFORE_CALL_67| Int) (v_main_~a~0.offset_BEFORE_CALL_76 Int) (|v_old(#length)_BEFORE_CALL_67| (Array Int Int))) (and (< v_main_~i~0_BEFORE_CALL_86 ~SIZE~0) (or (and (= (select |v_old(#length)_BEFORE_CALL_67| 1) 2) (= (select |v_old(#valid)_BEFORE_CALL_67| 3) 1) (= ~MAX~0 100000) (= (select |v_old(#valid)_BEFORE_CALL_67| 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_76 2)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_67| 1) |v_old(#length)_BEFORE_CALL_67|)) (= (select |v_old(#length)_BEFORE_CALL_67| 2) 9) (not (= v_main_~a~0.base_BEFORE_CALL_76 0)) (= (select |v_old(#valid)_BEFORE_CALL_67| 1) 1) (= (select |v_old(#valid)_BEFORE_CALL_67| 2) 1) (not (= ~SIZE~0 100000)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_67| 1) 0) 48) (= (select |v_old(#valid)_BEFORE_CALL_67| v_main_~a~0.base_BEFORE_CALL_76) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_67| 1) 1) 0) (not (= |v_old(#valid)_BEFORE_CALL_67| |v_old(#length)_BEFORE_CALL_67|)) (not (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_76) (select |v_old(#memory_int)_BEFORE_CALL_67| 1))) (not (= v_main_~a~0.base_BEFORE_CALL_76 |#StackHeapBarrier|)) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_76 3)) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_76) 0) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_67| 1) |v_old(#valid)_BEFORE_CALL_67|)) (= (select |v_old(#length)_BEFORE_CALL_67| 3) 12) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (not (= v_main_~a~0.base_BEFORE_CALL_76 1)) (= v_main_~a~0.offset_BEFORE_CALL_76 0) (= |v_old(~SIZE~0)_BEFORE_CALL_67| 0) (= |#NULL.base| 0)) (and (= (select |v_old(#length)_BEFORE_CALL_67| 1) 2) (= (select |v_old(#valid)_BEFORE_CALL_67| 3) 1) (= ~MAX~0 100000) (= (select |v_old(#valid)_BEFORE_CALL_67| 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_76 2)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_67| 1) |v_old(#length)_BEFORE_CALL_67|)) (= (select |v_old(#length)_BEFORE_CALL_67| 2) 9) (not (= v_main_~a~0.base_BEFORE_CALL_76 0)) (= (select |v_old(#valid)_BEFORE_CALL_67| 1) 1) (= (select |v_old(#valid)_BEFORE_CALL_67| 2) 1) (not (= ~SIZE~0 100000)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_67| 1) 0) 48) (= (select |v_old(#valid)_BEFORE_CALL_67| v_main_~a~0.base_BEFORE_CALL_76) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_67| 1) 1) 0) (not (= |v_old(#valid)_BEFORE_CALL_67| |v_old(#length)_BEFORE_CALL_67|)) (not (= v_main_~a~0.base_BEFORE_CALL_76 |#StackHeapBarrier|)) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_76 3)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_67| 1) |v_old(#valid)_BEFORE_CALL_67|)) (= (select |v_old(#length)_BEFORE_CALL_67| 3) 12) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (not (= v_main_~a~0.base_BEFORE_CALL_76 1)) (= v_main_~a~0.offset_BEFORE_CALL_76 0) (= |v_old(~SIZE~0)_BEFORE_CALL_67| 0) (= v_main_~i~0_BEFORE_CALL_86 0) (= |#NULL.base| 0))) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_76) (+ v_main_~a~0.offset_BEFORE_CALL_76 (* v_main_~i~0_BEFORE_CALL_86 4))) 0)))))' at error location [2023-04-01 08:51:11,705 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:51:11,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 08:51:11,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2023-04-01 08:51:11,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816009795] [2023-04-01 08:51:11,705 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 08:51:11,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 08:51:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:51:11,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 08:51:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1579, Unknown=8, NotChecked=0, Total=1722 [2023-04-01 08:51:11,707 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-01 08:51:14,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:51:14,705 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2023-04-01 08:51:14,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-04-01 08:51:14,706 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 37 [2023-04-01 08:51:14,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:51:14,706 INFO L225 Difference]: With dead ends: 80 [2023-04-01 08:51:14,706 INFO L226 Difference]: Without dead ends: 49 [2023-04-01 08:51:14,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 49 SyntacticMatches, 5 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=427, Invalid=4254, Unknown=11, NotChecked=0, Total=4692 [2023-04-01 08:51:14,708 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 72 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 08:51:14,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 182 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 404 Invalid, 1 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 08:51:14,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-04-01 08:51:14,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2023-04-01 08:51:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2023-04-01 08:51:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2023-04-01 08:51:14,719 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 37 [2023-04-01 08:51:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:51:14,719 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2023-04-01 08:51:14,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 1.5769230769230769) internal successors, (41), 25 states have internal predecessors, (41), 9 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2023-04-01 08:51:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2023-04-01 08:51:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-04-01 08:51:14,720 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:51:14,720 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:51:14,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 08:51:14,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:14,925 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:51:14,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:51:14,925 INFO L85 PathProgramCache]: Analyzing trace with hash 730154768, now seen corresponding path program 6 times [2023-04-01 08:51:14,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:51:14,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213250629] [2023-04-01 08:51:14,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:51:14,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:51:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:51:15,308 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-01 08:51:15,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:51:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213250629] [2023-04-01 08:51:15,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213250629] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:51:15,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596190158] [2023-04-01 08:51:15,309 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 08:51:15,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:15,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:51:15,310 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 08:51:15,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 08:51:15,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 08:51:15,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 08:51:15,388 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 39 conjunts are in the unsatisfiable core [2023-04-01 08:51:15,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:51:15,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-04-01 08:51:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 08:51:16,021 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:51:16,102 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 08:51:16,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 50 [2023-04-01 08:51:16,110 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-04-01 08:51:16,110 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 13 treesize of output 12 [2023-04-01 08:51:16,131 INFO L350 Elim1Store]: Elim1 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 7 treesize of output 3 [2023-04-01 08:51:16,139 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-01 08:51:16,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 17 [2023-04-01 08:51:16,166 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 8 proven. 41 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-04-01 08:51:16,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [596190158] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 08:51:16,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1602413815] [2023-04-01 08:51:16,169 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 08:51:16,169 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:51:16,170 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:51:16,170 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:51:16,170 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:51:16,208 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:51:17,100 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 93 for LOIs [2023-04-01 08:51:17,258 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:51:17,261 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:51:18,772 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2538#(and (exists ((v_main_~a~0.base_BEFORE_CALL_97 Int) (v_main_~i~0_BEFORE_CALL_107 Int) (|v_old(#length)_BEFORE_CALL_80| (Array Int Int)) (v_main_~a~0.offset_BEFORE_CALL_97 Int) (|v_old(#memory_int)_BEFORE_CALL_80| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_80| (Array Int Int)) (|v_old(~SIZE~0)_BEFORE_CALL_80| Int)) (and (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_97) (+ v_main_~a~0.offset_BEFORE_CALL_97 (* v_main_~i~0_BEFORE_CALL_107 4))) 0)) (or (and (not (= (select |v_old(#memory_int)_BEFORE_CALL_80| 1) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_97))) (= ~MAX~0 100000) (= |v_old(~SIZE~0)_BEFORE_CALL_80| 0) (not (= v_main_~a~0.base_BEFORE_CALL_97 0)) (= (select |v_old(#valid)_BEFORE_CALL_80| v_main_~a~0.base_BEFORE_CALL_97) 0) (= (select |v_old(#valid)_BEFORE_CALL_80| 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_97 3)) (not (= v_main_~a~0.base_BEFORE_CALL_97 1)) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_80| 1) 0)) (not (= |v_old(#valid)_BEFORE_CALL_80| |v_old(#length)_BEFORE_CALL_80|)) (not (= ~SIZE~0 100000)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_80| 1) 1) 0) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_97 2)) (= (select |v_old(#valid)_BEFORE_CALL_80| 3) 1) (= 2 (select |v_old(#length)_BEFORE_CALL_80| 1)) (= 9 (select |v_old(#length)_BEFORE_CALL_80| 2)) (= (select |v_old(#length)_BEFORE_CALL_80| 3) 12) (= 0 (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_97) 0)) (not (= ~SIZE~0 1)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_80| 1) |v_old(#length)_BEFORE_CALL_80|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_80| 1) |v_old(#valid)_BEFORE_CALL_80|)) (= (select |v_old(#valid)_BEFORE_CALL_80| 1) 1) (= |#NULL.offset| 0) (= (select |v_old(#valid)_BEFORE_CALL_80| 2) 1) (= v_main_~a~0.offset_BEFORE_CALL_97 0) (= |#NULL.base| 0) (not (= v_main_~a~0.base_BEFORE_CALL_97 |#StackHeapBarrier|))) (and (= ~MAX~0 100000) (= |v_old(~SIZE~0)_BEFORE_CALL_80| 0) (not (= v_main_~a~0.base_BEFORE_CALL_97 0)) (= (select |v_old(#valid)_BEFORE_CALL_80| v_main_~a~0.base_BEFORE_CALL_97) 0) (= (select |v_old(#valid)_BEFORE_CALL_80| 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_97 3)) (not (= v_main_~a~0.base_BEFORE_CALL_97 1)) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_80| 1) 0)) (not (= |v_old(#valid)_BEFORE_CALL_80| |v_old(#length)_BEFORE_CALL_80|)) (not (= ~SIZE~0 100000)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_80| 1) 1) 0) (not (= |#StackHeapBarrier| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_97 2)) (= (select |v_old(#valid)_BEFORE_CALL_80| 3) 1) (= v_main_~i~0_BEFORE_CALL_107 0) (= 2 (select |v_old(#length)_BEFORE_CALL_80| 1)) (= 9 (select |v_old(#length)_BEFORE_CALL_80| 2)) (= (select |v_old(#length)_BEFORE_CALL_80| 3) 12) (not (= ~SIZE~0 1)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_80| 1) |v_old(#length)_BEFORE_CALL_80|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_80| 1) |v_old(#valid)_BEFORE_CALL_80|)) (= (select |v_old(#valid)_BEFORE_CALL_80| 1) 1) (= |#NULL.offset| 0) (= (select |v_old(#valid)_BEFORE_CALL_80| 2) 1) (= v_main_~a~0.offset_BEFORE_CALL_97 0) (= |#NULL.base| 0) (not (= v_main_~a~0.base_BEFORE_CALL_97 |#StackHeapBarrier|)))) (< v_main_~i~0_BEFORE_CALL_107 ~SIZE~0))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0))' at error location [2023-04-01 08:51:18,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:51:18,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 08:51:18,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 33 [2023-04-01 08:51:18,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440616028] [2023-04-01 08:51:18,773 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 08:51:18,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-01 08:51:18,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:51:18,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-01 08:51:18,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1918, Unknown=5, NotChecked=0, Total=2070 [2023-04-01 08:51:18,775 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 33 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 11 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 08:51:19,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:51:19,270 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2023-04-01 08:51:19,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-01 08:51:19,270 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 11 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 45 [2023-04-01 08:51:19,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:51:19,271 INFO L225 Difference]: With dead ends: 58 [2023-04-01 08:51:19,271 INFO L226 Difference]: Without dead ends: 56 [2023-04-01 08:51:19,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 97 SyntacticMatches, 9 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=233, Invalid=2732, Unknown=5, NotChecked=0, Total=2970 [2023-04-01 08:51:19,272 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 08:51:19,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 214 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 08:51:19,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-04-01 08:51:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2023-04-01 08:51:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 08:51:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2023-04-01 08:51:19,290 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 45 [2023-04-01 08:51:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:51:19,290 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2023-04-01 08:51:19,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.59375) internal successors, (51), 31 states have internal predecessors, (51), 11 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-04-01 08:51:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2023-04-01 08:51:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-04-01 08:51:19,294 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:51:19,294 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:51:19,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-04-01 08:51:19,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-01 08:51:19,502 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:51:19,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:51:19,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1642848151, now seen corresponding path program 7 times [2023-04-01 08:51:19,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:51:19,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482432905] [2023-04-01 08:51:19,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:51:19,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:51:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:51:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 37 proven. 28 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 08:51:19,685 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:51:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482432905] [2023-04-01 08:51:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482432905] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:51:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135451724] [2023-04-01 08:51:19,685 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 08:51:19,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:19,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:51:19,689 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 08:51:19,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 08:51:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:51:19,765 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 08:51:19,767 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:51:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 08:51:19,926 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:51:20,028 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 50 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 08:51:20,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135451724] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 08:51:20,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [450593281] [2023-04-01 08:51:20,030 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 08:51:20,030 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:51:20,030 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:51:20,030 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:51:20,030 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:51:20,064 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:51:20,915 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 93 for LOIs [2023-04-01 08:51:21,059 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:51:21,063 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:51:22,278 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3070#(and (exists ((|v_old(~SIZE~0)_BEFORE_CALL_93| Int) (|v_old(#length)_BEFORE_CALL_93| (Array Int Int)) (v_main_~a~0.base_BEFORE_CALL_110 Int) (|v_old(#memory_int)_BEFORE_CALL_93| (Array Int (Array Int Int))) (v_main_~i~0_BEFORE_CALL_130 Int) (|v_old(#valid)_BEFORE_CALL_93| (Array Int Int)) (v_main_~a~0.offset_BEFORE_CALL_110 Int)) (and (< v_main_~i~0_BEFORE_CALL_130 ~SIZE~0) (or (and (not (= v_main_~a~0.base_BEFORE_CALL_110 0)) (not (= v_main_~a~0.base_BEFORE_CALL_110 3)) (= (select |v_old(#valid)_BEFORE_CALL_93| 2) 1) (= (select |v_old(#valid)_BEFORE_CALL_93| 1) 1) (= 2 (select |v_old(#length)_BEFORE_CALL_93| 1)) (= v_main_~a~0.offset_BEFORE_CALL_110 0) (= (select |v_old(#length)_BEFORE_CALL_93| 3) 12) (= ~MAX~0 100000) (not (= |v_old(#valid)_BEFORE_CALL_93| |v_old(#length)_BEFORE_CALL_93|)) (not (= v_main_~a~0.base_BEFORE_CALL_110 2)) (not (= v_main_~a~0.base_BEFORE_CALL_110 |#StackHeapBarrier|)) (= (select |v_old(#valid)_BEFORE_CALL_93| 3) 1) (= 9 (select |v_old(#length)_BEFORE_CALL_93| 2)) (not (= ~SIZE~0 100000)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_93| 1) 1) 0) (= |v_old(~SIZE~0)_BEFORE_CALL_93| 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_93| 1) 0) 48) (not (= (select |v_old(#memory_int)_BEFORE_CALL_93| 1) |v_old(#length)_BEFORE_CALL_93|)) (= v_main_~i~0_BEFORE_CALL_130 0) (not (= |#StackHeapBarrier| 0)) (not (= |v_old(#valid)_BEFORE_CALL_93| (select |v_old(#memory_int)_BEFORE_CALL_93| 1))) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (= 0 (select |v_old(#valid)_BEFORE_CALL_93| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_110 1)) (= (select |v_old(#valid)_BEFORE_CALL_93| v_main_~a~0.base_BEFORE_CALL_110) 0) (= |#NULL.base| 0)) (and (not (= v_main_~a~0.base_BEFORE_CALL_110 0)) (not (= v_main_~a~0.base_BEFORE_CALL_110 3)) (= (select |v_old(#valid)_BEFORE_CALL_93| 2) 1) (= (select |v_old(#valid)_BEFORE_CALL_93| 1) 1) (= 2 (select |v_old(#length)_BEFORE_CALL_93| 1)) (= v_main_~a~0.offset_BEFORE_CALL_110 0) (= (select |v_old(#length)_BEFORE_CALL_93| 3) 12) (= ~MAX~0 100000) (not (= |v_old(#valid)_BEFORE_CALL_93| |v_old(#length)_BEFORE_CALL_93|)) (not (= v_main_~a~0.base_BEFORE_CALL_110 2)) (not (= v_main_~a~0.base_BEFORE_CALL_110 |#StackHeapBarrier|)) (= (select |v_old(#valid)_BEFORE_CALL_93| 3) 1) (= 9 (select |v_old(#length)_BEFORE_CALL_93| 2)) (not (= ~SIZE~0 100000)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_93| 1) 1) 0) (= |v_old(~SIZE~0)_BEFORE_CALL_93| 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_93| 1) 0) 48) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_110) 0) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_93| 1) |v_old(#length)_BEFORE_CALL_93|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_93| 1) (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_110))) (not (= |#StackHeapBarrier| 0)) (not (= |v_old(#valid)_BEFORE_CALL_93| (select |v_old(#memory_int)_BEFORE_CALL_93| 1))) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (= 0 (select |v_old(#valid)_BEFORE_CALL_93| 0)) (not (= v_main_~a~0.base_BEFORE_CALL_110 1)) (= (select |v_old(#valid)_BEFORE_CALL_93| v_main_~a~0.base_BEFORE_CALL_110) 0) (= |#NULL.base| 0))) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_110) (+ (* v_main_~i~0_BEFORE_CALL_130 4) v_main_~a~0.offset_BEFORE_CALL_110)) 0)))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0))' at error location [2023-04-01 08:51:22,278 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:51:22,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 08:51:22,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 14] total 23 [2023-04-01 08:51:22,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021424619] [2023-04-01 08:51:22,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 08:51:22,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 08:51:22,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:51:22,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 08:51:22,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1088, Unknown=5, NotChecked=0, Total=1260 [2023-04-01 08:51:22,281 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 13 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-04-01 08:51:22,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:51:22,453 INFO L93 Difference]: Finished difference Result 105 states and 108 transitions. [2023-04-01 08:51:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 08:51:22,454 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 13 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 52 [2023-04-01 08:51:22,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:51:22,455 INFO L225 Difference]: With dead ends: 105 [2023-04-01 08:51:22,455 INFO L226 Difference]: Without dead ends: 60 [2023-04-01 08:51:22,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 125 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=237, Invalid=1398, Unknown=5, NotChecked=0, Total=1640 [2023-04-01 08:51:22,456 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 08:51:22,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 78 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 08:51:22,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-01 08:51:22,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2023-04-01 08:51:22,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-04-01 08:51:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2023-04-01 08:51:22,466 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 52 [2023-04-01 08:51:22,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:51:22,466 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2023-04-01 08:51:22,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 13 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-04-01 08:51:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2023-04-01 08:51:22,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-04-01 08:51:22,467 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:51:22,467 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:51:22,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 08:51:22,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 08:51:22,672 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:51:22,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:51:22,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1391652837, now seen corresponding path program 8 times [2023-04-01 08:51:22,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:51:22,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850833252] [2023-04-01 08:51:22,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:51:22,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:51:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:51:23,201 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 10 proven. 61 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 08:51:23,202 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:51:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850833252] [2023-04-01 08:51:23,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850833252] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:51:23,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729584980] [2023-04-01 08:51:23,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 08:51:23,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:23,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:51:23,205 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 08:51:23,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 08:51:23,457 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 08:51:23,458 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 08:51:23,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 30 conjunts are in the unsatisfiable core [2023-04-01 08:51:23,462 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:51:23,612 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 45 [2023-04-01 08:51:23,618 INFO L350 Elim1Store]: Elim1 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 12 treesize of output 11 [2023-04-01 08:51:24,618 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-04-01 08:51:24,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2023-04-01 08:51:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 35 proven. 36 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 08:51:24,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 08:51:24,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [729584980] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:51:24,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1063472005] [2023-04-01 08:51:24,755 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 08:51:24,755 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 08:51:24,755 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 08:51:24,755 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 08:51:24,755 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 08:51:24,787 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 56 for LOIs [2023-04-01 08:51:25,566 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 93 for LOIs [2023-04-01 08:51:25,712 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 13 for LOIs [2023-04-01 08:51:25,715 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 08:51:31,068 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3547#(and (exists ((|v_old(#memory_int)_BEFORE_CALL_106| (Array Int (Array Int Int))) (v_main_~a~0.base_BEFORE_CALL_128 Int) (v_main_~a~0.offset_BEFORE_CALL_128 Int) (|v_old(~SIZE~0)_BEFORE_CALL_106| Int) (v_main_~i~0_BEFORE_CALL_148 Int) (|v_old(#length)_BEFORE_CALL_106| (Array Int Int)) (|v_old(#valid)_BEFORE_CALL_106| (Array Int Int))) (and (< v_main_~i~0_BEFORE_CALL_148 ~SIZE~0) (or (and (= |v_old(~SIZE~0)_BEFORE_CALL_106| 0) (not (= |v_old(#valid)_BEFORE_CALL_106| (select |v_old(#memory_int)_BEFORE_CALL_106| 1))) (= 2 (select |v_old(#length)_BEFORE_CALL_106| 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_106| 1) 1) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_106| 1) 0) 48) (not (= |v_old(#length)_BEFORE_CALL_106| (select |v_old(#memory_int)_BEFORE_CALL_106| 1))) (= 12 (select |v_old(#length)_BEFORE_CALL_106| 3)) (not (= (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_128) (select |v_old(#memory_int)_BEFORE_CALL_106| 1))) (= ~MAX~0 100000) (= v_main_~a~0.offset_BEFORE_CALL_128 0) (= (select |v_old(#valid)_BEFORE_CALL_106| 1) 1) (= 9 (select |v_old(#length)_BEFORE_CALL_106| 2)) (= (select |v_old(#valid)_BEFORE_CALL_106| v_main_~a~0.base_BEFORE_CALL_128) 0) (not (= ~SIZE~0 100000)) (= (select |v_old(#valid)_BEFORE_CALL_106| 2) 1) (not (= |#StackHeapBarrier| 0)) (not (= |v_old(#valid)_BEFORE_CALL_106| |v_old(#length)_BEFORE_CALL_106|)) (not (= v_main_~a~0.base_BEFORE_CALL_128 1)) (not (= v_main_~a~0.base_BEFORE_CALL_128 3)) (not (= v_main_~a~0.base_BEFORE_CALL_128 2)) (= (select |v_old(#valid)_BEFORE_CALL_106| 3) 1) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_128) 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_128 |#StackHeapBarrier|)) (= (select |v_old(#valid)_BEFORE_CALL_106| 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_128 0)) (= |#NULL.base| 0)) (and (= |v_old(~SIZE~0)_BEFORE_CALL_106| 0) (not (= |v_old(#valid)_BEFORE_CALL_106| (select |v_old(#memory_int)_BEFORE_CALL_106| 1))) (= v_main_~i~0_BEFORE_CALL_148 0) (= 2 (select |v_old(#length)_BEFORE_CALL_106| 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_106| 1) 1) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_106| 1) 0) 48) (not (= |v_old(#length)_BEFORE_CALL_106| (select |v_old(#memory_int)_BEFORE_CALL_106| 1))) (= 12 (select |v_old(#length)_BEFORE_CALL_106| 3)) (= ~MAX~0 100000) (= v_main_~a~0.offset_BEFORE_CALL_128 0) (= (select |v_old(#valid)_BEFORE_CALL_106| 1) 1) (= 9 (select |v_old(#length)_BEFORE_CALL_106| 2)) (= (select |v_old(#valid)_BEFORE_CALL_106| v_main_~a~0.base_BEFORE_CALL_128) 0) (not (= ~SIZE~0 100000)) (= (select |v_old(#valid)_BEFORE_CALL_106| 2) 1) (not (= |#StackHeapBarrier| 0)) (not (= |v_old(#valid)_BEFORE_CALL_106| |v_old(#length)_BEFORE_CALL_106|)) (not (= v_main_~a~0.base_BEFORE_CALL_128 1)) (not (= v_main_~a~0.base_BEFORE_CALL_128 3)) (not (= v_main_~a~0.base_BEFORE_CALL_128 2)) (= (select |v_old(#valid)_BEFORE_CALL_106| 3) 1) (not (= ~SIZE~0 1)) (= |#NULL.offset| 0) (not (= v_main_~a~0.base_BEFORE_CALL_128 |#StackHeapBarrier|)) (= (select |v_old(#valid)_BEFORE_CALL_106| 0) 0) (not (= v_main_~a~0.base_BEFORE_CALL_128 0)) (= |#NULL.base| 0))) (not (= (select (select |#memory_int| v_main_~a~0.base_BEFORE_CALL_128) (+ (* v_main_~i~0_BEFORE_CALL_148 4) v_main_~a~0.offset_BEFORE_CALL_128)) 0)))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0))' at error location [2023-04-01 08:51:31,068 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 08:51:31,068 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 08:51:31,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 35 [2023-04-01 08:51:31,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375161084] [2023-04-01 08:51:31,068 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 08:51:31,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-01 08:51:31,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 08:51:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-01 08:51:31,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=2276, Unknown=9, NotChecked=0, Total=2450 [2023-04-01 08:51:31,070 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 13 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2023-04-01 08:51:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 08:51:43,094 INFO L93 Difference]: Finished difference Result 110 states and 113 transitions. [2023-04-01 08:51:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-04-01 08:51:43,095 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 13 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) Word has length 53 [2023-04-01 08:51:43,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 08:51:43,095 INFO L225 Difference]: With dead ends: 110 [2023-04-01 08:51:43,095 INFO L226 Difference]: Without dead ends: 65 [2023-04-01 08:51:43,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 73 SyntacticMatches, 9 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=586, Invalid=6538, Unknown=16, NotChecked=0, Total=7140 [2023-04-01 08:51:43,098 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 112 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 100 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-01 08:51:43,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 264 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 748 Invalid, 1 Unknown, 0 Unchecked, 1.0s Time] [2023-04-01 08:51:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-04-01 08:51:43,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-04-01 08:51:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 9 states have call successors, (9), 9 states have call predecessors, (9), 8 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2023-04-01 08:51:43,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2023-04-01 08:51:43,110 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 53 [2023-04-01 08:51:43,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 08:51:43,111 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2023-04-01 08:51:43,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 33 states have internal predecessors, (53), 13 states have call successors, (15), 5 states have call predecessors, (15), 3 states have return successors, (12), 12 states have call predecessors, (12), 11 states have call successors, (12) [2023-04-01 08:51:43,111 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2023-04-01 08:51:43,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-04-01 08:51:43,112 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 08:51:43,112 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 08:51:43,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 08:51:43,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-01 08:51:43,318 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 08:51:43,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 08:51:43,318 INFO L85 PathProgramCache]: Analyzing trace with hash 60383600, now seen corresponding path program 9 times [2023-04-01 08:51:43,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 08:51:43,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180832089] [2023-04-01 08:51:43,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 08:51:43,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 08:51:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 08:51:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 12 proven. 85 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-04-01 08:51:43,802 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 08:51:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180832089] [2023-04-01 08:51:43,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180832089] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 08:51:43,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720182807] [2023-04-01 08:51:43,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 08:51:43,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 08:51:43,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 08:51:43,804 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 08:51:43,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 08:51:43,883 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 08:51:43,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 08:51:43,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 47 conjunts are in the unsatisfiable core [2023-04-01 08:51:43,887 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 08:51:44,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 11 treesize of output 7 [2023-04-01 08:51:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 3 proven. 109 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-04-01 08:51:44,771 INFO L327 TraceCheckSpWp]: Computing backward predicates...