/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-fpi/conda.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 09:03:51,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 09:03:51,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 09:03:51,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 09:03:51,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 09:03:51,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 09:03:51,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 09:03:51,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 09:03:51,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 09:03:51,489 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 09:03:51,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 09:03:51,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 09:03:51,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 09:03:51,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 09:03:51,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 09:03:51,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 09:03:51,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 09:03:51,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 09:03:51,495 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 09:03:51,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 09:03:51,496 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 09:03:51,497 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 09:03:51,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 09:03:51,498 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 09:03:51,501 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 09:03:51,501 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 09:03:51,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 09:03:51,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 09:03:51,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 09:03:51,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 09:03:51,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 09:03:51,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 09:03:51,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 09:03:51,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 09:03:51,504 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 09:03:51,504 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 09:03:51,505 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 09:03:51,505 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 09:03:51,505 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 09:03:51,506 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 09:03:51,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 09:03:51,507 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 09:03:51,521 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 09:03:51,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 09:03:51,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 09:03:51,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 09:03:51,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 09:03:51,522 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 09:03:51,522 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 09:03:51,522 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 09:03:51,522 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 09:03:51,522 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 09:03:51,522 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 09:03:51,522 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 09:03:51,523 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 09:03:51,523 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 09:03:51,523 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 09:03:51,523 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 09:03:51,523 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 09:03:51,523 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 09:03:51,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 09:03:51,524 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 09:03:51,525 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 09:03:51,525 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 09:03:51,525 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 09:03:51,525 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 09:03:51,525 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 09:03:51,525 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 09:03:51,525 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 09:03:51,525 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 09:03:51,525 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 09:03:51,526 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 09:03:51,526 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 09:03:51,526 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 09:03:51,526 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 09:03:51,526 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 09:03:51,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 09:03:51,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 09:03:51,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 09:03:51,708 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 09:03:51,709 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 09:03:51,710 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/conda.c [2023-04-01 09:03:52,901 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 09:03:53,081 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 09:03:53,084 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/conda.c [2023-04-01 09:03:53,090 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb8b88a5/82e5d27e8e1e4ab19e9e23eae8416a3a/FLAGe70771c31 [2023-04-01 09:03:53,102 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb8b88a5/82e5d27e8e1e4ab19e9e23eae8416a3a [2023-04-01 09:03:53,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 09:03:53,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 09:03:53,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 09:03:53,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 09:03:53,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 09:03:53,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@141892f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53, skipping insertion in model container [2023-04-01 09:03:53,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 09:03:53,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 09:03:53,237 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-fpi/conda.c[588,601] [2023-04-01 09:03:53,257 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 09:03:53,268 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 09:03:53,278 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-fpi/conda.c[588,601] [2023-04-01 09:03:53,289 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 09:03:53,299 INFO L208 MainTranslator]: Completed translation [2023-04-01 09:03:53,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53 WrapperNode [2023-04-01 09:03:53,300 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 09:03:53,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 09:03:53,301 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 09:03:53,301 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 09:03:53,308 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,337 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 09:03:53,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 09:03:53,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 09:03:53,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 09:03:53,340 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (1/1) ... [2023-04-01 09:03:53,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 09:03:53,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:03:53,374 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 09:03:53,381 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 09:03:53,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 09:03:53,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 09:03:53,408 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 09:03:53,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 09:03:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 09:03:53,411 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 09:03:53,411 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 09:03:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 09:03:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 09:03:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 09:03:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 09:03:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 09:03:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 09:03:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-04-01 09:03:53,412 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 09:03:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 09:03:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-04-01 09:03:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 09:03:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 09:03:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 09:03:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 09:03:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 09:03:53,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 09:03:53,478 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 09:03:53,479 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 09:03:53,618 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 09:03:53,648 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 09:03:53,648 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-04-01 09:03:53,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 09:03:53 BoogieIcfgContainer [2023-04-01 09:03:53,650 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 09:03:53,651 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 09:03:53,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 09:03:53,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 09:03:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 09:03:53" (1/3) ... [2023-04-01 09:03:53,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fc4e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 09:03:53, skipping insertion in model container [2023-04-01 09:03:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 09:03:53" (2/3) ... [2023-04-01 09:03:53,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fc4e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 09:03:53, skipping insertion in model container [2023-04-01 09:03:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 09:03:53" (3/3) ... [2023-04-01 09:03:53,655 INFO L112 eAbstractionObserver]: Analyzing ICFG conda.c [2023-04-01 09:03:53,667 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 09:03:53,667 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 09:03:53,711 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 09:03:53,718 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;@18ae48c3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 09:03:53,719 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 09:03:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 09:03:53,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-04-01 09:03:53,728 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:03:53,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:03:53,729 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:03:53,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:03:53,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1638581746, now seen corresponding path program 1 times [2023-04-01 09:03:53,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:03:53,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887098109] [2023-04-01 09:03:53,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:53,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:03:53,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:53,963 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 09:03:53,964 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:03:53,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887098109] [2023-04-01 09:03:53,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887098109] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 09:03:53,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 09:03:53,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-04-01 09:03:53,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116009245] [2023-04-01 09:03:53,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 09:03:53,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 09:03:53,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:03:53,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 09:03:53,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 09:03:53,996 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.4) internal successors, (21), 16 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:03:54,080 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2023-04-01 09:03:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-04-01 09:03:54,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-04-01 09:03:54,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:03:54,085 INFO L225 Difference]: With dead ends: 46 [2023-04-01 09:03:54,086 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 09:03:54,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-04-01 09:03:54,090 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 22 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 09:03:54,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 36 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 09:03:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 09:03:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 09:03:54,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-04-01 09:03:54,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 17 [2023-04-01 09:03:54,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:03:54,121 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-04-01 09:03:54,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 3 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:03:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-04-01 09:03:54,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-01 09:03:54,122 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:03:54,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:03:54,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 09:03:54,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:03:54,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:03:54,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1163256344, now seen corresponding path program 1 times [2023-04-01 09:03:54,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:03:54,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532195535] [2023-04-01 09:03:54,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:54,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:03:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:54,997 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 09:03:54,998 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:03:54,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532195535] [2023-04-01 09:03:54,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532195535] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:03:54,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789743534] [2023-04-01 09:03:54,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:03:55,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:03:55,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:03:55,041 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 09:03:55,076 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 09:03:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:03:55,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 42 conjunts are in the unsatisfiable core [2023-04-01 09:03:55,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:03:55,258 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 09:03:55,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 09:03:55,328 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 09:03:55,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 09:03:55,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-04-01 09:03:55,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 09:03:55,483 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2023-04-01 09:03:55,542 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 09:03:55,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:03:55,640 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_int| c_main_~a~0.base)) (.cse4 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (let ((.cse0 (= (select .cse3 .cse4) 1)) (.cse1 (* c_~N~0 2))) (and (or (not .cse0) (= .cse1 (let ((.cse2 (store .cse3 .cse4 2))) (+ (select (select (store |c_#memory_int| c_main_~a~0.base .cse2) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|) (select .cse2 c_main_~a~0.offset))))) (or .cse0 (forall ((v_ArrVal_42 (Array Int Int))) (= .cse1 (+ (select v_ArrVal_42 c_main_~a~0.offset) (select (select (store |c_#memory_int| c_main_~a~0.base v_ArrVal_42) |c_main_~#sum~0.base|) |c_main_~#sum~0.offset|)))))))) is different from false [2023-04-01 09:03:55,773 INFO L173 IndexEqualityManager]: detected equality via solver [2023-04-01 09:03:55,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-04-01 09:03:55,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789743534] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:03:55,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2073681355] [2023-04-01 09:03:55,906 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 09:03:55,906 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:03:55,910 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:03:55,914 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:03:55,914 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:03:56,083 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 86 for LOIs [2023-04-01 09:03:57,951 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 106 for LOIs [2023-04-01 09:03:57,995 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 91 for LOIs [2023-04-01 09:03:58,004 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:03:58,009 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:03:59,670 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '279#(and (exists ((|v_old(#length)_BEFORE_CALL_3| (Array Int Int)) (|v_old(#memory_int)_BEFORE_CALL_3| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_3| (Array Int Int)) (|v_main_~#sum~0.base_BEFORE_CALL_1| Int)) (and (not (= (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_1|) 0))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) |v_old(#length)_BEFORE_CALL_3|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 4) 97) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 7) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 6) 99) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 1) 0) 48) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 1) 1) 0) (= (select |v_old(#valid)_BEFORE_CALL_3| 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_3| |v_old(#length)_BEFORE_CALL_3|)) (= (select |v_old(#valid)_BEFORE_CALL_3| |v_main_~#sum~0.base_BEFORE_CALL_1|) 0) (= 2 (select |v_old(#length)_BEFORE_CALL_3| 1)) (= (select |v_old(#length)_BEFORE_CALL_3| 3) 12) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_1|)) (not (= |v_old(#length)_BEFORE_CALL_3| (select |v_old(#memory_int)_BEFORE_CALL_3| 1))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) |v_old(#valid)_BEFORE_CALL_3|)) (= (select |v_old(#length)_BEFORE_CALL_3| 2) 8) (= 111 (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 0) 99) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_1|)) (not (= |v_old(#valid)_BEFORE_CALL_3| (select |v_old(#memory_int)_BEFORE_CALL_3| 1))) (= (select |v_old(#valid)_BEFORE_CALL_3| 2) 1) (= (select |v_old(#valid)_BEFORE_CALL_3| 1) 1) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| |#StackHeapBarrier|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| 1)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_1| 0)) (= (select |v_old(#valid)_BEFORE_CALL_3| 3) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 3) 100) (= (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 5) 46) (= 110 (select (select |v_old(#memory_int)_BEFORE_CALL_3| 2) 2)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_3| 2) (select |v_old(#memory_int)_BEFORE_CALL_3| 1))))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 09:03:59,671 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:03:59,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:03:59,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 14] total 31 [2023-04-01 09:03:59,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998683906] [2023-04-01 09:03:59,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:03:59,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-01 09:03:59,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:03:59,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-01 09:03:59,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1683, Unknown=1, NotChecked=84, Total=1980 [2023-04-01 09:03:59,675 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 09:04:00,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:04:00,089 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2023-04-01 09:04:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 09:04:00,090 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 20 [2023-04-01 09:04:00,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:04:00,091 INFO L225 Difference]: With dead ends: 33 [2023-04-01 09:04:00,092 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 09:04:00,093 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=269, Invalid=2086, Unknown=1, NotChecked=94, Total=2450 [2023-04-01 09:04:00,093 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 38 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 09:04:00,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 76 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 270 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2023-04-01 09:04:00,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 09:04:00,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-04-01 09:04:00,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:04:00,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-04-01 09:04:00,102 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 20 [2023-04-01 09:04:00,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:04:00,102 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-04-01 09:04:00,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 28 states have internal predecessors, (33), 5 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 09:04:00,102 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-04-01 09:04:00,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 09:04:00,103 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:04:00,103 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:04:00,129 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 09:04:00,303 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 09:04:00,304 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:04:00,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:04:00,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1718330715, now seen corresponding path program 2 times [2023-04-01 09:04:00,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:04:00,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418826012] [2023-04-01 09:04:00,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:04:00,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:04:00,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:04:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:04:00,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:04:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418826012] [2023-04-01 09:04:00,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418826012] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:04:00,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051701461] [2023-04-01 09:04:00,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 09:04:00,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:04:00,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:04:00,410 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 09:04:00,427 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 09:04:00,477 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-04-01 09:04:00,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 09:04:00,478 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 09:04:00,479 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:04:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:04:00,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:04:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:04:00,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051701461] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:04:00,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [648128115] [2023-04-01 09:04:00,524 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 09:04:00,524 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:04:00,524 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:04:00,524 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:04:00,525 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:04:00,579 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 86 for LOIs [2023-04-01 09:04:01,867 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 106 for LOIs [2023-04-01 09:04:01,908 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 91 for LOIs [2023-04-01 09:04:01,917 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:04:01,921 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:04:03,201 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '536#(and (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (= |#NULL.offset| 0) (exists ((|v_old(#memory_int)_BEFORE_CALL_7| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_7| (Array Int Int)) (|v_main_~#sum~0.base_BEFORE_CALL_2| Int) (|v_old(#length)_BEFORE_CALL_7| (Array Int Int))) (and (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 7) 0) (= (select |v_old(#valid)_BEFORE_CALL_7| 1) 1) (= (select |v_old(#valid)_BEFORE_CALL_7| 2) 1) (= (select |v_old(#valid)_BEFORE_CALL_7| 0) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 1) 1) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 1) 0) 48) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| 0)) (= (select |v_old(#valid)_BEFORE_CALL_7| 3) 1) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) |v_old(#valid)_BEFORE_CALL_7|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 2) |v_old(#length)_BEFORE_CALL_7|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 3) 100) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_2|)) (= 2 (select |v_old(#length)_BEFORE_CALL_7| 1)) (= 111 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 6) 99) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| 1)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_2| |#StackHeapBarrier|)) (= 0 (select |v_old(#valid)_BEFORE_CALL_7| |v_main_~#sum~0.base_BEFORE_CALL_2|)) (= 8 (select |v_old(#length)_BEFORE_CALL_7| 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 0) 99) (= 46 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 5)) (= 110 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 2)) (= 97 (select (select |v_old(#memory_int)_BEFORE_CALL_7| 2) 4)) (not (= (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_2|) 0))) (= (select |v_old(#length)_BEFORE_CALL_7| 3) 12) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) |v_old(#length)_BEFORE_CALL_7|)) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_2|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 2) |v_old(#valid)_BEFORE_CALL_7|)) (not (= |v_old(#valid)_BEFORE_CALL_7| |v_old(#length)_BEFORE_CALL_7|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_7| 1) (select |v_old(#memory_int)_BEFORE_CALL_7| 2))))) (= |#NULL.base| 0))' at error location [2023-04-01 09:04:03,202 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:04:03,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:04:03,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2023-04-01 09:04:03,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366710791] [2023-04-01 09:04:03,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:04:03,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-04-01 09:04:03,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:04:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-04-01 09:04:03,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2023-04-01 09:04:03,203 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:04:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:04:03,266 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2023-04-01 09:04:03,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 09:04:03,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-04-01 09:04:03,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:04:03,268 INFO L225 Difference]: With dead ends: 40 [2023-04-01 09:04:03,268 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 09:04:03,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2023-04-01 09:04:03,269 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 4 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 09:04:03,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 39 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 09:04:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 09:04:03,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2023-04-01 09:04:03,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:04:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2023-04-01 09:04:03,275 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 21 [2023-04-01 09:04:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:04:03,275 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2023-04-01 09:04:03,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:04:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2023-04-01 09:04:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-04-01 09:04:03,276 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:04:03,276 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:04:03,283 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 09:04:03,476 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 09:04:03,477 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:04:03,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:04:03,477 INFO L85 PathProgramCache]: Analyzing trace with hash 391632903, now seen corresponding path program 3 times [2023-04-01 09:04:03,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:04:03,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771831720] [2023-04-01 09:04:03,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:04:03,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:04:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:04:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:04:03,557 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:04:03,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771831720] [2023-04-01 09:04:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771831720] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:04:03,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471494785] [2023-04-01 09:04:03,559 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 09:04:03,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:04:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:04:03,560 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 09:04:03,585 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 09:04:03,633 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 09:04:03,634 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 09:04:03,634 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 09:04:03,636 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:04:03,660 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:04:03,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:04:03,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 09:04:03,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471494785] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:04:03,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2004391218] [2023-04-01 09:04:03,702 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 09:04:03,702 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:04:03,702 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:04:03,702 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:04:03,703 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:04:03,758 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 86 for LOIs [2023-04-01 09:04:05,070 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 106 for LOIs [2023-04-01 09:04:05,110 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 91 for LOIs [2023-04-01 09:04:05,118 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:04:05,122 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:04:06,423 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '801#(and (exists ((|v_old(#memory_int)_BEFORE_CALL_11| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_11| (Array Int Int)) (|v_main_~#sum~0.base_BEFORE_CALL_3| Int) (|v_old(#length)_BEFORE_CALL_11| (Array Int Int))) (and (not (= (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_3|) 0))) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 4) 97) (= 46 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 5)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) |v_old(#valid)_BEFORE_CALL_11|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 1) 111) (not (= |v_old(#valid)_BEFORE_CALL_11| (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (= 110 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 2)) (= 1 (select |v_old(#valid)_BEFORE_CALL_11| 2)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_11| 2) |v_old(#length)_BEFORE_CALL_11|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 1) 1) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 6) 99) (not (= |v_old(#length)_BEFORE_CALL_11| (select |v_old(#memory_int)_BEFORE_CALL_11| 1))) (= (select |v_old(#valid)_BEFORE_CALL_11| |v_main_~#sum~0.base_BEFORE_CALL_3|) 0) (= 12 (select |v_old(#length)_BEFORE_CALL_11| 3)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 7) 0) (= 48 (select (select |v_old(#memory_int)_BEFORE_CALL_11| 1) 0)) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_3|)) (= (select |v_old(#valid)_BEFORE_CALL_11| 1) 1) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| 1)) (= 8 (select |v_old(#length)_BEFORE_CALL_11| 2)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| 0)) (= (select |v_old(#valid)_BEFORE_CALL_11| 3) 1) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_3|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 0) 99) (= (select |v_old(#length)_BEFORE_CALL_11| 1) 2) (not (= |v_old(#valid)_BEFORE_CALL_11| |v_old(#length)_BEFORE_CALL_11|)) (= (select |v_old(#valid)_BEFORE_CALL_11| 0) 0) (not (= |v_main_~#sum~0.base_BEFORE_CALL_3| |#StackHeapBarrier|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_11| 2) 3) 100))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 09:04:06,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:04:06,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:04:06,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2023-04-01 09:04:06,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619650113] [2023-04-01 09:04:06,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:04:06,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 09:04:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:04:06,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 09:04:06,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2023-04-01 09:04:06,425 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:04:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:04:06,494 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2023-04-01 09:04:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 09:04:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2023-04-01 09:04:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:04:06,496 INFO L225 Difference]: With dead ends: 31 [2023-04-01 09:04:06,496 INFO L226 Difference]: Without dead ends: 24 [2023-04-01 09:04:06,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 42 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=86, Invalid=616, Unknown=0, NotChecked=0, Total=702 [2023-04-01 09:04:06,497 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 09:04:06,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 09:04:06,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-01 09:04:06,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-04-01 09:04:06,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:04:06,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-04-01 09:04:06,502 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2023-04-01 09:04:06,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:04:06,502 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-04-01 09:04:06,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:04:06,502 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-04-01 09:04:06,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-04-01 09:04:06,503 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:04:06,503 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:04:06,519 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 09:04:06,709 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 09:04:06,710 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:04:06,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:04:06,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1923768434, now seen corresponding path program 4 times [2023-04-01 09:04:06,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:04:06,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651068670] [2023-04-01 09:04:06,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:04:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:04:06,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:04:07,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:04:07,740 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:04:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651068670] [2023-04-01 09:04:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651068670] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:04:07,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719092538] [2023-04-01 09:04:07,741 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 09:04:07,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:04:07,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:04:07,742 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 09:04:07,744 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 09:04:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:04:07,804 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 59 conjunts are in the unsatisfiable core [2023-04-01 09:04:07,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:04:07,813 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 10 treesize of output 8 [2023-04-01 09:04:07,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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 09:04:07,825 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 09:04:07,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 09:04:07,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2023-04-01 09:04:07,938 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2023-04-01 09:04:07,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2023-04-01 09:04:08,025 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 34 [2023-04-01 09:04:08,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 36 [2023-04-01 09:04:08,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 18 [2023-04-01 09:04:08,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:04:08,180 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:04:08,794 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int| c_main_~a~0.base)) (.cse13 (+ (* c_main_~i~0 4) c_main_~a~0.offset))) (let ((.cse0 (* c_~N~0 2)) (.cse5 (+ c_main_~a~0.offset 4)) (.cse6 (= (select .cse12 .cse13) 1))) (and (or (forall ((v_ArrVal_178 (Array Int Int))) (= .cse0 (let ((.cse3 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_178))) (let ((.cse4 (select .cse3 |c_main_~#sum~0.base|))) (let ((.cse1 (select .cse4 |c_main_~#sum~0.offset|)) (.cse2 (select v_ArrVal_178 c_main_~a~0.offset))) (+ .cse1 .cse2 (select (select (store .cse3 |c_main_~#sum~0.base| (store .cse4 |c_main_~#sum~0.offset| (+ .cse1 .cse2))) c_main_~a~0.base) .cse5))))))) .cse6) (or (= .cse0 (let ((.cse11 (store .cse12 .cse13 2))) (let ((.cse9 (store |c_#memory_int| c_main_~a~0.base .cse11))) (let ((.cse10 (select .cse9 |c_main_~#sum~0.base|))) (let ((.cse7 (select .cse10 |c_main_~#sum~0.offset|)) (.cse8 (select .cse11 c_main_~a~0.offset))) (+ .cse7 .cse8 (select (select (store .cse9 |c_main_~#sum~0.base| (store .cse10 |c_main_~#sum~0.offset| (+ .cse7 .cse8))) c_main_~a~0.base) .cse5))))))) (not .cse6))))) is different from false [2023-04-01 09:04:08,887 INFO L321 Elim1Store]: treesize reduction 12, result has 74.5 percent of original size [2023-04-01 09:04:08,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 140 [2023-04-01 09:04:09,020 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 10 treesize of output 3 [2023-04-01 09:04:11,767 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse31 (* c_main_~i~0 4))) (let ((.cse8 (select |c_#memory_int| c_main_~a~0.base)) (.cse9 (+ .cse31 c_main_~a~0.offset)) (.cse11 (* c_~N~0 2)) (.cse6 (+ c_main_~a~0.offset 4))) (let ((.cse12 (forall ((v_ArrVal_178 (Array Int Int))) (= .cse11 (let ((.cse34 (store |c_#memory_int| c_main_~a~0.base v_ArrVal_178))) (let ((.cse35 (select .cse34 |c_main_~#sum~0.base|))) (let ((.cse32 (select .cse35 |c_main_~#sum~0.offset|)) (.cse33 (select v_ArrVal_178 c_main_~a~0.offset))) (+ .cse32 .cse33 (select (select (store .cse34 |c_main_~#sum~0.base| (store .cse35 |c_main_~#sum~0.offset| (+ .cse32 .cse33))) c_main_~a~0.base) .cse6)))))))) (.cse10 (+ .cse31 c_main_~a~0.offset 4)) (.cse0 (= (select .cse8 .cse9) 1))) (and (or (not .cse0) (let ((.cse1 (= (select .cse8 .cse10) 1))) (and (or (not .cse1) (= (let ((.cse7 (store (store .cse8 .cse9 2) .cse10 2))) (let ((.cse4 (store |c_#memory_int| c_main_~a~0.base .cse7))) (let ((.cse5 (select .cse4 |c_main_~#sum~0.base|))) (let ((.cse2 (select .cse5 |c_main_~#sum~0.offset|)) (.cse3 (select .cse7 c_main_~a~0.offset))) (+ .cse2 .cse3 (select (select (store .cse4 |c_main_~#sum~0.base| (store .cse5 |c_main_~#sum~0.offset| (+ .cse2 .cse3))) c_main_~a~0.base) .cse6)))))) .cse11)) (or .cse1 .cse12)))) (or (let ((.cse13 (= (+ c_main_~i~0 1) 0))) (and .cse12 (or .cse13 (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 c_main_~a~0.offset) 1)) (= (let ((.cse14 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_1))) (let ((.cse15 (select .cse14 |c_main_~#sum~0.base|))) (let ((.cse16 (select .cse15 |c_main_~#sum~0.offset|))) (+ (select (select (store .cse14 |c_main_~#sum~0.base| (store .cse15 |c_main_~#sum~0.offset| (+ .cse16 1))) c_main_~a~0.base) .cse6) .cse16 1)))) .cse11) (not (= (select v_arrayElimArr_1 .cse10) 2))))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_1))) (let ((.cse18 (select .cse17 |c_main_~#sum~0.base|))) (let ((.cse19 (select .cse18 |c_main_~#sum~0.offset|))) (or (not (= (select v_arrayElimArr_1 c_main_~a~0.offset) 1)) (= (+ (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ .cse19 1))) c_main_~a~0.base) .cse6) .cse19 1) .cse11) (not (= (select v_arrayElimArr_1 .cse10) 2)) (= .cse11 (+ (select (select (store .cse17 |c_main_~#sum~0.base| (store .cse18 |c_main_~#sum~0.offset| (+ 2 .cse19))) c_main_~a~0.base) .cse6) 2 .cse19))))))) (or .cse13 (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (= .cse11 (let ((.cse21 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_1))) (let ((.cse22 (select .cse21 |c_main_~#sum~0.base|))) (let ((.cse20 (select v_arrayElimArr_1 c_main_~a~0.offset)) (.cse23 (select .cse22 |c_main_~#sum~0.offset|))) (+ .cse20 (select (select (store .cse21 |c_main_~#sum~0.base| (store .cse22 |c_main_~#sum~0.offset| (+ .cse20 .cse23))) c_main_~a~0.base) .cse6) .cse23))))) (not (= (select v_arrayElimArr_1 .cse10) 2)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_1))) (let ((.cse26 (select .cse25 |c_main_~#sum~0.base|))) (let ((.cse27 (select .cse26 |c_main_~#sum~0.offset|))) (or (= .cse11 (let ((.cse24 (select v_arrayElimArr_1 c_main_~a~0.offset))) (+ .cse24 (select (select (store .cse25 |c_main_~#sum~0.base| (store .cse26 |c_main_~#sum~0.offset| (+ .cse24 .cse27))) c_main_~a~0.base) .cse6) .cse27))) (not (= (select v_arrayElimArr_1 .cse10) 2)) (= .cse11 (+ (select (select (store .cse25 |c_main_~#sum~0.base| (store .cse26 |c_main_~#sum~0.offset| (+ 2 .cse27))) c_main_~a~0.base) .cse6) 2 .cse27))))))))) (or (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 c_main_~a~0.offset) 2)) (= .cse11 (let ((.cse28 (store |c_#memory_int| c_main_~a~0.base v_arrayElimArr_1))) (let ((.cse29 (select .cse28 |c_main_~#sum~0.base|))) (let ((.cse30 (select .cse29 |c_main_~#sum~0.offset|))) (+ (select (select (store .cse28 |c_main_~#sum~0.base| (store .cse29 |c_main_~#sum~0.offset| (+ 2 .cse30))) c_main_~a~0.base) .cse6) 2 .cse30))))))) (not .cse13)))) .cse0))))) is different from false [2023-04-01 09:04:24,924 WARN L223 SmtUtils]: Spent 11.58s on a formula simplification. DAG size of input: 92 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-04-01 09:04:25,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-04-01 09:04:25,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719092538] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:04:25,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1669411707] [2023-04-01 09:04:25,662 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 09:04:25,662 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:04:25,663 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:04:25,663 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:04:25,663 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:04:25,731 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 86 for LOIs [2023-04-01 09:04:27,242 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 106 for LOIs [2023-04-01 09:04:27,311 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 91 for LOIs [2023-04-01 09:04:27,324 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:04:27,334 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:04:37,683 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1076#(and (exists ((|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_~#sum~0.base_BEFORE_CALL_4| Int)) (and (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_4|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| |#StackHeapBarrier|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| 1)) (= (select |v_old(#valid)_BEFORE_CALL_15| 2) 1) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_4|)) (not (= |v_main_~#sum~0.base_BEFORE_CALL_4| 0)) (= (select |v_old(#length)_BEFORE_CALL_15| 3) 12) (= 100 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 3)) (= 97 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 4)) (= (select |v_old(#valid)_BEFORE_CALL_15| 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_15| |v_old(#length)_BEFORE_CALL_15|)) (not (= |v_old(#valid)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (= 110 (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 2)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 1) 111) (= (select |v_old(#length)_BEFORE_CALL_15| 2) 8) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 0) 48) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 7) 0) (not (= (select |v_old(#memory_int)_BEFORE_CALL_15| 2) |v_old(#length)_BEFORE_CALL_15|)) (= (select |v_old(#valid)_BEFORE_CALL_15| |v_main_~#sum~0.base_BEFORE_CALL_4|) 0) (= (select |v_old(#length)_BEFORE_CALL_15| 1) 2) (= (select |v_old(#valid)_BEFORE_CALL_15| 1) 1) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 6) 99) (not (= |v_old(#valid)_BEFORE_CALL_15| (select |v_old(#memory_int)_BEFORE_CALL_15| 2))) (not (= (select |v_old(#memory_int)_BEFORE_CALL_15| 2) (select |v_old(#memory_int)_BEFORE_CALL_15| 1))) (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| 2) 5) 46) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 1) 1) 0) (= (select (select |v_old(#memory_int)_BEFORE_CALL_15| 2) 0) 99) (not (= (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_4|) 0))))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 09:04:37,683 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:04:37,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:04:37,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2023-04-01 09:04:37,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294131824] [2023-04-01 09:04:37,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:04:37,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-01 09:04:37,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:04:37,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-01 09:04:37,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1525, Unknown=2, NotChecked=158, Total=1806 [2023-04-01 09:04:37,686 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 29 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:04:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:04:39,905 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2023-04-01 09:04:39,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 09:04:39,909 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2023-04-01 09:04:39,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:04:39,910 INFO L225 Difference]: With dead ends: 36 [2023-04-01 09:04:39,910 INFO L226 Difference]: Without dead ends: 31 [2023-04-01 09:04:39,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 27.9s TimeCoverageRelationStatistics Valid=134, Invalid=1678, Unknown=2, NotChecked=166, Total=1980 [2023-04-01 09:04:39,911 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 3 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-04-01 09:04:39,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 148 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 281 Invalid, 0 Unknown, 48 Unchecked, 1.7s Time] [2023-04-01 09:04:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-01 09:04:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-04-01 09:04:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:04:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2023-04-01 09:04:39,918 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 23 [2023-04-01 09:04:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:04:39,918 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2023-04-01 09:04:39,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:04:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2023-04-01 09:04:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-01 09:04:39,918 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:04:39,919 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:04:39,925 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 09:04:40,123 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 09:04:40,124 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:04:40,124 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:04:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1956565265, now seen corresponding path program 5 times [2023-04-01 09:04:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:04:40,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724367065] [2023-04-01 09:04:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:04:40,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:04:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:04:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 09:04:40,461 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:04:40,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724367065] [2023-04-01 09:04:40,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724367065] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:04:40,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524270616] [2023-04-01 09:04:40,462 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 09:04:40,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:04:40,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:04:40,481 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 09:04:40,483 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 09:04:40,561 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 09:04:40,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 09:04:40,562 INFO L262 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 09:04:40,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:04:41,237 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 09:04:41,237 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 09:04:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 09:04:41,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524270616] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 09:04:41,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1043885147] [2023-04-01 09:04:41,787 INFO L159 IcfgInterpreter]: Started Sifa with 18 locations of interest [2023-04-01 09:04:41,787 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 09:04:41,787 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 09:04:41,787 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 09:04:41,787 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 09:04:41,882 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 86 for LOIs [2023-04-01 09:04:43,269 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 106 for LOIs [2023-04-01 09:04:43,327 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 91 for LOIs [2023-04-01 09:04:43,340 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 10 for LOIs [2023-04-01 09:04:43,349 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 09:04:51,774 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1368#(and (exists ((|v_old(#length)_BEFORE_CALL_19| (Array Int Int)) (|v_old(#memory_int)_BEFORE_CALL_19| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_19| (Array Int Int)) (|v_main_~#sum~0.base_BEFORE_CALL_5| Int)) (and (= (select (select |v_old(#memory_int)_BEFORE_CALL_19| 1) 0) 48) (= (select |v_old(#valid)_BEFORE_CALL_19| |v_main_~#sum~0.base_BEFORE_CALL_5|) 0) (not (= (* 2 ~N~0) (select (select |#memory_int| |v_main_~#sum~0.base_BEFORE_CALL_5|) 0))) (= 12 (select |v_old(#length)_BEFORE_CALL_19| 3)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_19| 1) (select |v_old(#memory_int)_BEFORE_CALL_19| 2))) (not (= |v_main_~#sum~0.base_BEFORE_CALL_5| 0)) (= 110 (select (select |v_old(#memory_int)_BEFORE_CALL_19| 2) 2)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_19| 1) |v_old(#valid)_BEFORE_CALL_19|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_19| 2) 3) 100) (not (= 3 |v_main_~#sum~0.base_BEFORE_CALL_5|)) (not (= (select |v_old(#memory_int)_BEFORE_CALL_19| 1) |v_old(#length)_BEFORE_CALL_19|)) (= (select |v_old(#valid)_BEFORE_CALL_19| 0) 0) (not (= |v_main_~#sum~0.base_BEFORE_CALL_5| |#StackHeapBarrier|)) (= 111 (select (select |v_old(#memory_int)_BEFORE_CALL_19| 2) 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_19| 2) 0) 99) (not (= |v_old(#length)_BEFORE_CALL_19| (select |v_old(#memory_int)_BEFORE_CALL_19| 2))) (not (= 2 |v_main_~#sum~0.base_BEFORE_CALL_5|)) (= (select |v_old(#valid)_BEFORE_CALL_19| 3) 1) (= (select |v_old(#length)_BEFORE_CALL_19| 1) 2) (not (= |v_main_~#sum~0.base_BEFORE_CALL_5| 1)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_19| 2) 6) 99) (= (select |v_old(#length)_BEFORE_CALL_19| 2) 8) (= (select |v_old(#valid)_BEFORE_CALL_19| 2) 1) (= 97 (select (select |v_old(#memory_int)_BEFORE_CALL_19| 2) 4)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_19| 2) 7) 0) (not (= |v_old(#valid)_BEFORE_CALL_19| (select |v_old(#memory_int)_BEFORE_CALL_19| 2))) (= 1 (select |v_old(#valid)_BEFORE_CALL_19| 1)) (not (= |v_old(#valid)_BEFORE_CALL_19| |v_old(#length)_BEFORE_CALL_19|)) (= (select (select |v_old(#memory_int)_BEFORE_CALL_19| 2) 5) 46) (= (select (select |v_old(#memory_int)_BEFORE_CALL_19| 1) 1) 0))) (= |__VERIFIER_assert_#in~cond| 0) (= __VERIFIER_assert_~cond 0) (not (= ~N~0 0)) (not (= |#StackHeapBarrier| 0)) (= |#NULL.offset| 0) (= |#NULL.base| 0))' at error location [2023-04-01 09:04:51,774 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-04-01 09:04:51,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 09:04:51,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2023-04-01 09:04:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168394517] [2023-04-01 09:04:51,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 09:04:51,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-04-01 09:04:51,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 09:04:51,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-04-01 09:04:51,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=887, Unknown=0, NotChecked=0, Total=992 [2023-04-01 09:04:51,776 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:04:54,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 09:04:54,108 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2023-04-01 09:04:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 09:04:54,108 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2023-04-01 09:04:54,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 09:04:54,109 INFO L225 Difference]: With dead ends: 42 [2023-04-01 09:04:54,109 INFO L226 Difference]: Without dead ends: 27 [2023-04-01 09:04:54,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 534 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=185, Invalid=1455, Unknown=0, NotChecked=0, Total=1640 [2023-04-01 09:04:54,110 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 11 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-01 09:04:54,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 121 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-01 09:04:54,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-01 09:04:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-01 09:04:54,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 09:04:54,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2023-04-01 09:04:54,115 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2023-04-01 09:04:54,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 09:04:54,115 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2023-04-01 09:04:54,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 18 states have internal predecessors, (31), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 09:04:54,115 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2023-04-01 09:04:54,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 09:04:54,115 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 09:04:54,116 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 09:04:54,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-01 09:04:54,320 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 09:04:54,320 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 09:04:54,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 09:04:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash 847497832, now seen corresponding path program 6 times [2023-04-01 09:04:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 09:04:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531179856] [2023-04-01 09:04:54,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 09:04:54,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 09:04:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 09:04:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 09:04:58,667 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 09:04:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531179856] [2023-04-01 09:04:58,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531179856] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 09:04:58,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099539385] [2023-04-01 09:04:58,667 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 09:04:58,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 09:04:58,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 09:04:58,668 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 09:04:58,670 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 09:04:58,740 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 09:04:58,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 09:04:58,741 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 79 conjunts are in the unsatisfiable core [2023-04-01 09:04:58,745 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 09:04:58,760 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 09:04:58,806 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 10 treesize of output 8 [2023-04-01 09:04:59,021 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 23 treesize of output 22 [2023-04-01 09:04:59,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2023-04-01 09:04:59,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2023-04-01 09:05:00,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 88 [2023-04-01 09:05:01,304 INFO L321 Elim1Store]: treesize reduction 46, result has 59.6 percent of original size [2023-04-01 09:05:01,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 106 [2023-04-01 09:05:01,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 41 [2023-04-01 09:05:01,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 09:05:01,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 09:05:01,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-04-01 09:05:01,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13